./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:15:48,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:15:48,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:15:48,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:15:48,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:15:48,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:15:48,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:15:48,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:15:48,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:15:48,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:15:48,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:15:48,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:15:48,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:15:48,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:15:48,898 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:15:48,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:15:48,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:15:48,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:15:48,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:15:48,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:15:48,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:15:48,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:15:48,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:15:48,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:15:48,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:15:48,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:15:48,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:15:48,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:15:48,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:15:48,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:15:48,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:15:48,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:15:48,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:15:48,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:15:48,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:15:48,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:15:48,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:15:48,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:15:48,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:15:48,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:15:48,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:15:48,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:15:48,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 [2024-11-20 08:15:49,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:15:49,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:15:49,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:15:49,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:15:49,195 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:15:49,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2024-11-20 08:15:50,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:15:50,845 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:15:50,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2024-11-20 08:15:50,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e5e379c/e1d09755d26045af8dfc036a90e7c2d5/FLAG8cde9e54b [2024-11-20 08:15:50,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e5e379c/e1d09755d26045af8dfc036a90e7c2d5 [2024-11-20 08:15:50,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:15:50,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:15:50,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:15:50,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:15:50,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:15:50,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:15:50" (1/1) ... [2024-11-20 08:15:50,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758252fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:50, skipping insertion in model container [2024-11-20 08:15:50,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:15:50" (1/1) ... [2024-11-20 08:15:50,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:15:51,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i[913,926] [2024-11-20 08:15:51,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:15:51,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:15:51,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i[913,926] [2024-11-20 08:15:51,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:15:51,200 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:15:51,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51 WrapperNode [2024-11-20 08:15:51,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:15:51,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:15:51,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:15:51,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:15:51,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,262 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-11-20 08:15:51,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:15:51,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:15:51,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:15:51,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:15:51,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:15:51,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:15:51,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:15:51,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:15:51,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:15:51,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (1/1) ... [2024-11-20 08:15:51,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:15:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:15:51,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:15:51,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:15:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:15:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:15:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:15:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:15:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:15:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:15:51,520 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:15:51,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:15:51,808 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 08:15:51,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:15:51,822 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:15:51,822 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:15:51,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:15:51 BoogieIcfgContainer [2024-11-20 08:15:51,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:15:51,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:15:51,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:15:51,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:15:51,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:15:50" (1/3) ... [2024-11-20 08:15:51,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d947455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:15:51, skipping insertion in model container [2024-11-20 08:15:51,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:51" (2/3) ... [2024-11-20 08:15:51,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d947455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:15:51, skipping insertion in model container [2024-11-20 08:15:51,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:15:51" (3/3) ... [2024-11-20 08:15:51,833 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-56.i [2024-11-20 08:15:51,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:15:51,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:15:51,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:15:51,927 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7857e386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:15:51,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:15:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 08:15:51,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:51,949 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:51,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:51,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash 717215207, now seen corresponding path program 1 times [2024-11-20 08:15:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037031745] [2024-11-20 08:15:51,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037031745] [2024-11-20 08:15:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037031745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:52,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:15:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490921282] [2024-11-20 08:15:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:52,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:15:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:15:52,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:15:52,442 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:15:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:52,475 INFO L93 Difference]: Finished difference Result 135 states and 225 transitions. [2024-11-20 08:15:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:15:52,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2024-11-20 08:15:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:52,502 INFO L225 Difference]: With dead ends: 135 [2024-11-20 08:15:52,502 INFO L226 Difference]: Without dead ends: 67 [2024-11-20 08:15:52,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:15:52,515 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:52,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:15:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-20 08:15:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-20 08:15:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-20 08:15:52,554 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 124 [2024-11-20 08:15:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:52,554 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-20 08:15:52,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:15:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-20 08:15:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 08:15:52,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:52,558 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:52,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:15:52,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:52,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1725727131, now seen corresponding path program 1 times [2024-11-20 08:15:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114642132] [2024-11-20 08:15:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:55,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114642132] [2024-11-20 08:15:55,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114642132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:55,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:55,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:15:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783040906] [2024-11-20 08:15:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:55,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:15:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:15:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:15:55,117 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:55,617 INFO L93 Difference]: Finished difference Result 206 states and 298 transitions. [2024-11-20 08:15:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:15:55,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-20 08:15:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:55,623 INFO L225 Difference]: With dead ends: 206 [2024-11-20 08:15:55,625 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 08:15:55,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:15:55,627 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 114 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:55,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 482 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:15:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 08:15:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 80. [2024-11-20 08:15:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-20 08:15:55,648 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 124 [2024-11-20 08:15:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:55,650 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-20 08:15:55,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-20 08:15:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 08:15:55,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:55,653 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:55,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:15:55,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:55,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1467561693, now seen corresponding path program 1 times [2024-11-20 08:15:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267111802] [2024-11-20 08:15:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:56,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:56,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267111802] [2024-11-20 08:15:56,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267111802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:56,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:56,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:15:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839526892] [2024-11-20 08:15:56,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:56,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:15:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:56,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:15:56,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:15:56,788 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:57,274 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2024-11-20 08:15:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:15:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-20 08:15:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:57,278 INFO L225 Difference]: With dead ends: 223 [2024-11-20 08:15:57,278 INFO L226 Difference]: Without dead ends: 146 [2024-11-20 08:15:57,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:15:57,281 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 92 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:57,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 542 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:15:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-20 08:15:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 80. [2024-11-20 08:15:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-20 08:15:57,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 124 [2024-11-20 08:15:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:57,300 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-20 08:15:57,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-20 08:15:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 08:15:57,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:57,306 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:57,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:15:57,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:57,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1982434151, now seen corresponding path program 1 times [2024-11-20 08:15:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:57,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785619278] [2024-11-20 08:15:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:57,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785619278] [2024-11-20 08:15:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785619278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:57,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:15:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616644808] [2024-11-20 08:15:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:57,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:15:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:57,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:15:57,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:57,404 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:57,426 INFO L93 Difference]: Finished difference Result 158 states and 239 transitions. [2024-11-20 08:15:57,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:15:57,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-20 08:15:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:57,428 INFO L225 Difference]: With dead ends: 158 [2024-11-20 08:15:57,428 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 08:15:57,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:57,430 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:57,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:15:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 08:15:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 08:15:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2024-11-20 08:15:57,436 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 124 [2024-11-20 08:15:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:57,437 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2024-11-20 08:15:57,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2024-11-20 08:15:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 08:15:57,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:57,439 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:15:57,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -821812644, now seen corresponding path program 1 times [2024-11-20 08:15:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603345623] [2024-11-20 08:15:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603345623] [2024-11-20 08:15:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603345623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:57,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:15:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953079644] [2024-11-20 08:15:57,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:57,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:15:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:57,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:15:57,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:57,567 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:57,609 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2024-11-20 08:15:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:15:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-20 08:15:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:57,612 INFO L225 Difference]: With dead ends: 187 [2024-11-20 08:15:57,612 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:15:57,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:57,613 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:57,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 171 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:15:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:15:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2024-11-20 08:15:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2024-11-20 08:15:57,620 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 125 [2024-11-20 08:15:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:57,621 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2024-11-20 08:15:57,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2024-11-20 08:15:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 08:15:57,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:57,623 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:15:57,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1076882600, now seen corresponding path program 1 times [2024-11-20 08:15:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498138878] [2024-11-20 08:15:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498138878] [2024-11-20 08:15:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498138878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:57,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:15:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947275824] [2024-11-20 08:15:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:57,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:15:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:15:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:57,715 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:57,754 INFO L93 Difference]: Finished difference Result 201 states and 300 transitions. [2024-11-20 08:15:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:15:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-20 08:15:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:57,755 INFO L225 Difference]: With dead ends: 201 [2024-11-20 08:15:57,756 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:15:57,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:57,757 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:57,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 207 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:15:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:15:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2024-11-20 08:15:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:15:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-11-20 08:15:57,765 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 125 [2024-11-20 08:15:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:57,765 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-11-20 08:15:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-11-20 08:15:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 08:15:57,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:57,767 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:57,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:15:57,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:57,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1348444790, now seen corresponding path program 1 times [2024-11-20 08:15:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058773209] [2024-11-20 08:15:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:58,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058773209] [2024-11-20 08:15:58,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058773209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:58,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:58,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:15:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044800271] [2024-11-20 08:15:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:15:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:15:58,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:15:58,198 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:58,412 INFO L93 Difference]: Finished difference Result 194 states and 273 transitions. [2024-11-20 08:15:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:15:58,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-20 08:15:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:58,414 INFO L225 Difference]: With dead ends: 194 [2024-11-20 08:15:58,414 INFO L226 Difference]: Without dead ends: 192 [2024-11-20 08:15:58,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:15:58,415 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 130 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:58,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 588 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:15:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-20 08:15:58,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 150. [2024-11-20 08:15:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 08:15:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2024-11-20 08:15:58,442 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 126 [2024-11-20 08:15:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:58,442 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2024-11-20 08:15:58,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2024-11-20 08:15:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 08:15:58,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:58,444 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:15:58,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 993844826, now seen corresponding path program 1 times [2024-11-20 08:15:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599782545] [2024-11-20 08:15:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:15:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:15:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:15:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:15:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:15:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:15:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:15:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599782545] [2024-11-20 08:15:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599782545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:58,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:15:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062440094] [2024-11-20 08:15:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:15:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:15:58,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:15:58,612 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:58,692 INFO L93 Difference]: Finished difference Result 400 states and 565 transitions. [2024-11-20 08:15:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:15:58,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-20 08:15:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:58,696 INFO L225 Difference]: With dead ends: 400 [2024-11-20 08:15:58,696 INFO L226 Difference]: Without dead ends: 253 [2024-11-20 08:15:58,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:15:58,697 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:58,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 281 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:15:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-20 08:15:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2024-11-20 08:15:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 201 states have (on average 1.2985074626865671) internal successors, (261), 204 states have internal predecessors, (261), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:15:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 345 transitions. [2024-11-20 08:15:58,715 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 345 transitions. Word has length 126 [2024-11-20 08:15:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:58,715 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 345 transitions. [2024-11-20 08:15:58,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:15:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 345 transitions. [2024-11-20 08:15:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 08:15:58,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:58,717 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:58,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:15:58,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:58,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1673903196, now seen corresponding path program 1 times [2024-11-20 08:15:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:58,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345245445] [2024-11-20 08:15:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:16:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:16:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:16:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:16:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:16:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:16:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:16:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:16:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:16:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:16:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:16:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:16:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:16:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:16:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:16:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:16:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:16:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:16:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:16:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:16:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:16:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345245445] [2024-11-20 08:16:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345245445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:16:07,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:16:07,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:16:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9125625] [2024-11-20 08:16:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:16:07,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:16:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:16:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:16:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:16:07,295 INFO L87 Difference]: Start difference. First operand 248 states and 345 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:07,814 INFO L93 Difference]: Finished difference Result 644 states and 884 transitions. [2024-11-20 08:16:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:16:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-20 08:16:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:07,817 INFO L225 Difference]: With dead ends: 644 [2024-11-20 08:16:07,817 INFO L226 Difference]: Without dead ends: 399 [2024-11-20 08:16:07,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:16:07,819 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 117 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:07,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 297 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:16:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-20 08:16:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 264. [2024-11-20 08:16:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.2995391705069124) internal successors, (282), 220 states have internal predecessors, (282), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:16:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 366 transitions. [2024-11-20 08:16:07,836 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 366 transitions. Word has length 126 [2024-11-20 08:16:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:07,837 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 366 transitions. [2024-11-20 08:16:07,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 366 transitions. [2024-11-20 08:16:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 08:16:07,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:07,839 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:07,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:16:07,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:07,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash -17272424, now seen corresponding path program 1 times [2024-11-20 08:16:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:16:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657194737] [2024-11-20 08:16:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:16:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:16:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:16:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:16:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:16:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:16:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:16:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:16:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:16:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:16:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:16:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:16:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:16:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:16:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:16:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:16:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:16:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:16:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:16:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:16:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-20 08:16:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:16:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657194737] [2024-11-20 08:16:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657194737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:16:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393680835] [2024-11-20 08:16:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:08,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:16:08,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:16:08,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:16:08,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:16:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:08,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:16:08,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:16:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-20 08:16:08,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:16:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-20 08:16:08,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393680835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:16:08,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:16:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-20 08:16:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994030931] [2024-11-20 08:16:08,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:16:08,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:16:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:16:08,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:16:08,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:16:08,443 INFO L87 Difference]: Start difference. First operand 264 states and 366 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 08:16:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:08,739 INFO L93 Difference]: Finished difference Result 628 states and 874 transitions. [2024-11-20 08:16:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 08:16:08,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 126 [2024-11-20 08:16:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:08,744 INFO L225 Difference]: With dead ends: 628 [2024-11-20 08:16:08,747 INFO L226 Difference]: Without dead ends: 367 [2024-11-20 08:16:08,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 286 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:16:08,749 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 171 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:08,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 241 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:16:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-20 08:16:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 239. [2024-11-20 08:16:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 191 states have (on average 1.2670157068062826) internal successors, (242), 194 states have internal predecessors, (242), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:16:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 326 transitions. [2024-11-20 08:16:08,773 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 326 transitions. Word has length 126 [2024-11-20 08:16:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:08,774 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 326 transitions. [2024-11-20 08:16:08,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 08:16:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 326 transitions. [2024-11-20 08:16:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 08:16:08,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:08,777 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:08,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:16:08,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 08:16:08,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:08,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1170860347, now seen corresponding path program 1 times [2024-11-20 08:16:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:16:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242154372] [2024-11-20 08:16:08,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:16:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:16:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:16:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:16:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:16:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:16:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:16:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:16:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:16:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:16:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:16:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:16:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:16:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:16:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:16:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:16:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:16:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:16:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:16:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:16:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:16:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:16:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242154372] [2024-11-20 08:16:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242154372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:16:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:16:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:16:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534173701] [2024-11-20 08:16:09,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:16:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:16:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:16:09,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:16:09,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:16:09,048 INFO L87 Difference]: Start difference. First operand 239 states and 326 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:09,077 INFO L93 Difference]: Finished difference Result 464 states and 632 transitions. [2024-11-20 08:16:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:16:09,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-20 08:16:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:09,079 INFO L225 Difference]: With dead ends: 464 [2024-11-20 08:16:09,079 INFO L226 Difference]: Without dead ends: 228 [2024-11-20 08:16:09,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:16:09,081 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:09,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:16:09,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-20 08:16:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-20 08:16:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 180 states have (on average 1.2444444444444445) internal successors, (224), 183 states have internal predecessors, (224), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:16:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2024-11-20 08:16:09,096 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 126 [2024-11-20 08:16:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:09,097 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2024-11-20 08:16:09,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2024-11-20 08:16:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 08:16:09,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:09,100 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:16:09,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:09,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 159743097, now seen corresponding path program 1 times [2024-11-20 08:16:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:16:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205627249] [2024-11-20 08:16:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:16:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:16:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:16:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:16:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:16:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:16:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:16:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:16:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:16:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:16:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:16:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:16:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:16:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:16:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:16:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:16:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:16:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:16:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:16:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:16:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:16:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:16:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205627249] [2024-11-20 08:16:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205627249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:16:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:16:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:16:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164553424] [2024-11-20 08:16:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:16:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:16:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:16:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:16:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:16:16,457 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:16,903 INFO L93 Difference]: Finished difference Result 543 states and 722 transitions. [2024-11-20 08:16:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:16:16,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-20 08:16:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:16,907 INFO L225 Difference]: With dead ends: 543 [2024-11-20 08:16:16,907 INFO L226 Difference]: Without dead ends: 318 [2024-11-20 08:16:16,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:16:16,908 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 65 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:16,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 367 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:16:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-20 08:16:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 230. [2024-11-20 08:16:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 182 states have (on average 1.2307692307692308) internal successors, (224), 185 states have internal predecessors, (224), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:16:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 308 transitions. [2024-11-20 08:16:16,930 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 308 transitions. Word has length 126 [2024-11-20 08:16:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:16,930 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 308 transitions. [2024-11-20 08:16:16,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 308 transitions. [2024-11-20 08:16:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 08:16:16,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:16,932 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:16:16,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:16,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash -768548048, now seen corresponding path program 1 times [2024-11-20 08:16:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:16:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472085703] [2024-11-20 08:16:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:16:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:16:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:16:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:16:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:16:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:16:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:16:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:16:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:16:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:16:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:16:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:16:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:16:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:16:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:16:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:16:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:16:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:16:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:16:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:16:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:16:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:16:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472085703] [2024-11-20 08:16:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472085703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:16:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:16:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:16:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761345273] [2024-11-20 08:16:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:16:17,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:16:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:16:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:16:17,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:16:17,029 INFO L87 Difference]: Start difference. First operand 230 states and 308 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:17,063 INFO L93 Difference]: Finished difference Result 519 states and 688 transitions. [2024-11-20 08:16:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:16:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-20 08:16:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:17,066 INFO L225 Difference]: With dead ends: 519 [2024-11-20 08:16:17,066 INFO L226 Difference]: Without dead ends: 292 [2024-11-20 08:16:17,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:16:17,068 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:17,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:16:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-20 08:16:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-11-20 08:16:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 226 states have (on average 1.176991150442478) internal successors, (266), 231 states have internal predecessors, (266), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 08:16:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 378 transitions. [2024-11-20 08:16:17,099 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 378 transitions. Word has length 128 [2024-11-20 08:16:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:17,100 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 378 transitions. [2024-11-20 08:16:17,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 378 transitions. [2024-11-20 08:16:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 08:16:17,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:17,102 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:17,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 08:16:17,102 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:17,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1105236389, now seen corresponding path program 1 times [2024-11-20 08:16:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:16:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111738916] [2024-11-20 08:16:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:16:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:16:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:16:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:16:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:16:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:16:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:16:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:16:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:16:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:16:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:16:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:16:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:16:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:16:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:16:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:16:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 08:16:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:16:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:16:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:16:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:16:17,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:16:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111738916] [2024-11-20 08:16:17,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111738916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:16:17,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:16:17,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:16:17,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978866233] [2024-11-20 08:16:17,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:16:17,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:16:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:16:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:16:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:16:17,190 INFO L87 Difference]: Start difference. First operand 291 states and 378 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:17,226 INFO L93 Difference]: Finished difference Result 584 states and 757 transitions. [2024-11-20 08:16:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:16:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-11-20 08:16:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:17,229 INFO L225 Difference]: With dead ends: 584 [2024-11-20 08:16:17,229 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 08:16:17,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:16:17,230 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 39 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:17,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 186 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:16:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 08:16:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 262. [2024-11-20 08:16:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 212 states have (on average 1.179245283018868) internal successors, (250), 215 states have internal predecessors, (250), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:16:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 334 transitions. [2024-11-20 08:16:17,253 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 334 transitions. Word has length 128 [2024-11-20 08:16:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:17,253 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 334 transitions. [2024-11-20 08:16:17,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 08:16:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 334 transitions. [2024-11-20 08:16:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 08:16:17,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:17,255 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:17,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:16:17,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:17,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2144216366, now seen corresponding path program 1 times [2024-11-20 08:16:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:16:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107819198] [2024-11-20 08:16:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:16:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:16:17,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:16:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:16:17,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:16:17,379 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:16:17,380 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:16:17,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:16:17,385 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:17,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:16:17,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:16:17 BoogieIcfgContainer [2024-11-20 08:16:17,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:16:17,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:16:17,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:16:17,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:16:17,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:15:51" (3/4) ... [2024-11-20 08:16:17,486 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:16:17,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:16:17,488 INFO L158 Benchmark]: Toolchain (without parser) took 26614.37ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 141.4MB in the beginning and 617.5MB in the end (delta: -476.1MB). Peak memory consumption was 434.0MB. Max. memory is 16.1GB. [2024-11-20 08:16:17,488 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:16:17,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.12ms. Allocated memory is still 174.1MB. Free memory was 141.4MB in the beginning and 126.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:16:17,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 174.1MB. Free memory was 126.0MB in the beginning and 122.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 08:16:17,493 INFO L158 Benchmark]: Boogie Preprocessor took 82.80ms. Allocated memory is still 174.1MB. Free memory was 122.6MB in the beginning and 117.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:16:17,493 INFO L158 Benchmark]: RCFGBuilder took 472.18ms. Allocated memory is still 174.1MB. Free memory was 117.0MB in the beginning and 94.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 08:16:17,494 INFO L158 Benchmark]: TraceAbstraction took 25657.44ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 93.9MB in the beginning and 618.5MB in the end (delta: -524.6MB). Peak memory consumption was 385.7MB. Max. memory is 16.1GB. [2024-11-20 08:16:17,494 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 1.1GB. Free memory was 618.5MB in the beginning and 617.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:16:17,496 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.12ms. Allocated memory is still 174.1MB. Free memory was 141.4MB in the beginning and 126.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 174.1MB. Free memory was 126.0MB in the beginning and 122.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.80ms. Allocated memory is still 174.1MB. Free memory was 122.6MB in the beginning and 117.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 472.18ms. Allocated memory is still 174.1MB. Free memory was 117.0MB in the beginning and 94.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25657.44ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 93.9MB in the beginning and 618.5MB in the end (delta: -524.6MB). Peak memory consumption was 385.7MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 1.1GB. Free memory was 618.5MB in the beginning and 617.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] double var_1_9 = 10.5; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] double var_1_13 = 99.25; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_7=2, var_1_8=8, var_1_9=21/2] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=2, var_1_8=8, var_1_9=21/2] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_8=8, var_1_9=21/2] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_8=8, var_1_9=21/2] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=8, var_1_9=21/2] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=8, var_1_9=21/2] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_9=21/2] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_9=21/2] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L94] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L97] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L97] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L99] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=1, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L40] COND TRUE (last_1_var_1_14 >> var_1_3) >= last_1_var_1_14 [L41] var_1_1 = ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L45] COND FALSE !((var_1_8 + var_1_1) >= var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L49] COND FALSE !(var_1_1 >= (var_1_8 << var_1_3)) [L56] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=-255, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L63] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=-255, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L64] COND TRUE stepLocal_0 || var_1_16 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=21/2] [L65] COND TRUE stepLocal_1 > var_1_6 [L66] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=259, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=259] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=259, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=259] [L106] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=259, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=259] [L106-L107] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=259, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=259] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=259, var_1_14=64, var_1_16=-255, var_1_17=0, var_1_18=-255, var_1_1=0, var_1_3=0, var_1_5=254, var_1_6=63, var_1_7=3, var_1_8=1, var_1_9=259] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 4042 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2610 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1331 IncrementalHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 1432 mSDtfsCounter, 1331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 832 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=13, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 600 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 2012 NumberOfCodeBlocks, 2012 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1994 ConstructedInterpolants, 0 QuantifiedInterpolants, 7048 SizeOfPredicates, 2 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 10926/10944 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:16:17,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:16:19,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:16:19,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:16:19,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:16:19,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:16:19,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:16:19,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:16:19,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:16:19,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:16:19,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:16:19,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:16:19,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:16:19,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:16:19,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:16:19,822 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:16:19,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:16:19,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:16:19,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:16:19,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:16:19,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:16:19,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:16:19,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:16:19,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:16:19,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:16:19,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:16:19,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:16:19,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:16:19,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:16:19,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:16:19,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:16:19,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:16:19,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:16:19,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:16:19,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:16:19,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:16:19,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:16:19,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:16:19,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:16:19,830 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:16:19,830 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:16:19,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:16:19,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:16:19,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:16:19,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:16:19,832 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 490983baa73e78cedc1fd82ca87154a66bb4f29bb6792de18df4399a6d4d2c54 [2024-11-20 08:16:20,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:16:20,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:16:20,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:16:20,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:16:20,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:16:20,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2024-11-20 08:16:21,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:16:21,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:16:21,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i [2024-11-20 08:16:22,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b8eec5e/29d2f40d8fbd450183c4b32be174fa60/FLAG574803d7e [2024-11-20 08:16:22,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b8eec5e/29d2f40d8fbd450183c4b32be174fa60 [2024-11-20 08:16:22,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:16:22,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:16:22,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:16:22,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:16:22,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:16:22,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a32330b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22, skipping insertion in model container [2024-11-20 08:16:22,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:16:22,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i[913,926] [2024-11-20 08:16:22,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:16:22,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:16:22,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-56.i[913,926] [2024-11-20 08:16:22,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:16:22,734 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:16:22,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22 WrapperNode [2024-11-20 08:16:22,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:16:22,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:16:22,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:16:22,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:16:22,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,794 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-20 08:16:22,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:16:22,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:16:22,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:16:22,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:16:22,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,835 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:16:22,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:16:22,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:16:22,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:16:22,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:16:22,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (1/1) ... [2024-11-20 08:16:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:16:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:16:22,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:16:22,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:16:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:16:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:16:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:16:22,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:16:22,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:16:22,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:16:23,025 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:16:23,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:16:23,271 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 08:16:23,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:16:23,283 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:16:23,284 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:16:23,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:16:23 BoogieIcfgContainer [2024-11-20 08:16:23,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:16:23,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:16:23,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:16:23,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:16:23,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:16:22" (1/3) ... [2024-11-20 08:16:23,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b4f6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:16:23, skipping insertion in model container [2024-11-20 08:16:23,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:16:22" (2/3) ... [2024-11-20 08:16:23,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b4f6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:16:23, skipping insertion in model container [2024-11-20 08:16:23,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:16:23" (3/3) ... [2024-11-20 08:16:23,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-56.i [2024-11-20 08:16:23,305 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:16:23,305 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:16:23,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:16:23,378 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48c134f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:16:23,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:16:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:16:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:16:23,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:23,392 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:23,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:23,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2146284140, now seen corresponding path program 1 times [2024-11-20 08:16:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:16:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422170450] [2024-11-20 08:16:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:16:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:16:23,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:16:23,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:16:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:23,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:16:23,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:16:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-20 08:16:23,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:16:23,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:16:23,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422170450] [2024-11-20 08:16:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422170450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:16:23,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:16:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:16:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698771206] [2024-11-20 08:16:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:16:23,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:16:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:16:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:16:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:16:23,695 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:16:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:16:23,718 INFO L93 Difference]: Finished difference Result 107 states and 185 transitions. [2024-11-20 08:16:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:16:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-11-20 08:16:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:16:23,725 INFO L225 Difference]: With dead ends: 107 [2024-11-20 08:16:23,725 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 08:16:23,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:16:23,730 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:16:23,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:16:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 08:16:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-20 08:16:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 08:16:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-11-20 08:16:23,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 119 [2024-11-20 08:16:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:16:23,765 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-11-20 08:16:23,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 08:16:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-11-20 08:16:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:16:23,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:16:23,769 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:16:23,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:16:23,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:16:23,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:16:23,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:16:23,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2079666602, now seen corresponding path program 1 times [2024-11-20 08:16:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:16:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14541324] [2024-11-20 08:16:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:16:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:16:23,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:16:23,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:16:23,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:16:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:16:24,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 08:16:24,107 INFO L278 TraceCheckSpWp]: Computing forward predicates...