./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:15:17,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:15:17,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:15:17,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:15:17,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:15:17,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:15:17,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:15:17,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:15:17,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:15:17,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:15:17,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:15:17,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:15:17,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:15:17,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:15:17,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:15:17,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:15:17,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:15:17,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:15:17,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:15:17,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:15:17,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:15:17,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:15:17,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:15:17,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:15:17,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:15:17,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:15:17,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:15:17,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:15:17,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:15:17,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:15:17,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:15:17,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:15:17,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:15:17,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:15:17,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:15:17,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:15:17,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:15:17,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:15:17,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:15:17,685 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2024-10-11 06:15:18,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:15:18,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:15:18,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:15:18,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:15:18,069 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:15:18,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-10-11 06:15:19,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:15:19,956 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:15:19,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-10-11 06:15:19,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/950124919/7cbf51dd79414b0ca501c2e71c135d72/FLAGd0a5e2cda [2024-10-11 06:15:19,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/950124919/7cbf51dd79414b0ca501c2e71c135d72 [2024-10-11 06:15:19,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:15:19,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:15:19,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:15:19,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:15:20,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:15:20,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:19" (1/1) ... [2024-10-11 06:15:20,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a189b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20, skipping insertion in model container [2024-10-11 06:15:20,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:19" (1/1) ... [2024-10-11 06:15:20,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:15:20,315 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-10-11 06:15:20,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:15:20,652 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:15:20,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-10-11 06:15:20,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:15:20,813 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:15:20,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20 WrapperNode [2024-10-11 06:15:20,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:15:20,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:15:20,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:15:20,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:15:20,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:20,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,305 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2024-10-11 06:15:21,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:15:21,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:15:21,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:15:21,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:15:21,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,593 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-10-11 06:15:21,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:15:21,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:15:21,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:15:21,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:15:21,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (1/1) ... [2024-10-11 06:15:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:15:21,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:15:21,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:15:21,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:15:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:15:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:15:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:15:22,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:15:22,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:15:22,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:15:26,300 INFO L? ?]: Removed 1863 outVars from TransFormulas that were not future-live. [2024-10-11 06:15:26,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:15:26,416 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:15:26,416 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:15:26,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:26 BoogieIcfgContainer [2024-10-11 06:15:26,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:15:26,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:15:26,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:15:26,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:15:26,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:15:19" (1/3) ... [2024-10-11 06:15:26,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266dd174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:26, skipping insertion in model container [2024-10-11 06:15:26,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:20" (2/3) ... [2024-10-11 06:15:26,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266dd174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:26, skipping insertion in model container [2024-10-11 06:15:26,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:26" (3/3) ... [2024-10-11 06:15:26,426 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-10-11 06:15:26,444 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:15:26,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:15:26,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:15:26,560 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;@626a6d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:15:26,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:15:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 1075 states, 1073 states have (on average 1.5079217148182666) internal successors, (1618), 1074 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 06:15:26,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:26,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:26,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:26,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1000420886, now seen corresponding path program 1 times [2024-10-11 06:15:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833279633] [2024-10-11 06:15:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:27,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:15:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833279633] [2024-10-11 06:15:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833279633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:27,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:15:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114765706] [2024-10-11 06:15:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:27,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:15:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:15:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:15:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:27,525 INFO L87 Difference]: Start difference. First operand has 1075 states, 1073 states have (on average 1.5079217148182666) internal successors, (1618), 1074 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:27,693 INFO L93 Difference]: Finished difference Result 2046 states and 3082 transitions. [2024-10-11 06:15:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:15:27,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 06:15:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:27,717 INFO L225 Difference]: With dead ends: 2046 [2024-10-11 06:15:27,721 INFO L226 Difference]: Without dead ends: 1076 [2024-10-11 06:15:27,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:27,737 INFO L432 NwaCegarLoop]: 1613 mSDtfsCounter, 0 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4834 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-10-11 06:15:27,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4834 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:15:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-11 06:15:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2024-10-11 06:15:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 1.5051162790697674) internal successors, (1618), 1075 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1618 transitions. [2024-10-11 06:15:27,839 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1618 transitions. Word has length 86 [2024-10-11 06:15:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:27,840 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1618 transitions. [2024-10-11 06:15:27,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1618 transitions. [2024-10-11 06:15:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 06:15:27,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:27,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:27,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:15:27,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -946580708, now seen corresponding path program 1 times [2024-10-11 06:15:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890183367] [2024-10-11 06:15:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:28,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:15:28,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890183367] [2024-10-11 06:15:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890183367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:28,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:28,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:15:28,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357986081] [2024-10-11 06:15:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:15:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:15:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:15:28,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:28,214 INFO L87 Difference]: Start difference. First operand 1076 states and 1618 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:28,290 INFO L93 Difference]: Finished difference Result 2049 states and 3082 transitions. [2024-10-11 06:15:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:15:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 06:15:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:28,297 INFO L225 Difference]: With dead ends: 2049 [2024-10-11 06:15:28,298 INFO L226 Difference]: Without dead ends: 1078 [2024-10-11 06:15:28,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:28,303 INFO L432 NwaCegarLoop]: 1613 mSDtfsCounter, 0 mSDsluCounter, 3218 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4831 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:28,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4831 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:15:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-10-11 06:15:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-10-11 06:15:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5041782729805013) internal successors, (1620), 1077 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1620 transitions. [2024-10-11 06:15:28,343 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1620 transitions. Word has length 87 [2024-10-11 06:15:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:28,345 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1620 transitions. [2024-10-11 06:15:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1620 transitions. [2024-10-11 06:15:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 06:15:28,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:28,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:28,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:15:28,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:28,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash -377196285, now seen corresponding path program 1 times [2024-10-11 06:15:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66060495] [2024-10-11 06:15:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:15:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66060495] [2024-10-11 06:15:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66060495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:15:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453173061] [2024-10-11 06:15:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:15:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:15:28,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:15:28,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:28,601 INFO L87 Difference]: Start difference. First operand 1078 states and 1620 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:28,663 INFO L93 Difference]: Finished difference Result 2053 states and 3086 transitions. [2024-10-11 06:15:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:15:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-11 06:15:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:28,669 INFO L225 Difference]: With dead ends: 2053 [2024-10-11 06:15:28,669 INFO L226 Difference]: Without dead ends: 1080 [2024-10-11 06:15:28,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:28,672 INFO L432 NwaCegarLoop]: 1613 mSDtfsCounter, 0 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4825 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:28,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4825 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:15:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-11 06:15:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2024-10-11 06:15:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 1.5032437442075997) internal successors, (1622), 1079 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1622 transitions. [2024-10-11 06:15:28,700 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1622 transitions. Word has length 88 [2024-10-11 06:15:28,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:28,701 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1622 transitions. [2024-10-11 06:15:28,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1622 transitions. [2024-10-11 06:15:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 06:15:28,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:28,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:28,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:15:28,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2100704387, now seen corresponding path program 1 times [2024-10-11 06:15:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:28,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211789734] [2024-10-11 06:15:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:15:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211789734] [2024-10-11 06:15:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211789734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:15:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677327793] [2024-10-11 06:15:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:15:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:15:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:15:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:29,007 INFO L87 Difference]: Start difference. First operand 1080 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:29,070 INFO L93 Difference]: Finished difference Result 2063 states and 3098 transitions. [2024-10-11 06:15:29,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:15:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 06:15:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:29,077 INFO L225 Difference]: With dead ends: 2063 [2024-10-11 06:15:29,077 INFO L226 Difference]: Without dead ends: 1088 [2024-10-11 06:15:29,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:29,082 INFO L432 NwaCegarLoop]: 1613 mSDtfsCounter, 3 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4825 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:29,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4825 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:15:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-11 06:15:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1084. [2024-10-11 06:15:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5032317636195753) internal successors, (1628), 1083 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1628 transitions. [2024-10-11 06:15:29,112 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1628 transitions. Word has length 89 [2024-10-11 06:15:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:29,113 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1628 transitions. [2024-10-11 06:15:29,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1628 transitions. [2024-10-11 06:15:29,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 06:15:29,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:29,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:15:29,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1811520284, now seen corresponding path program 1 times [2024-10-11 06:15:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140997590] [2024-10-11 06:15:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:15:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140997590] [2024-10-11 06:15:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140997590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:15:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862314255] [2024-10-11 06:15:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:29,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:15:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:15:29,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:15:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:15:29,472 INFO L87 Difference]: Start difference. First operand 1084 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:30,667 INFO L93 Difference]: Finished difference Result 3026 states and 4546 transitions. [2024-10-11 06:15:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:15:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 06:15:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:30,676 INFO L225 Difference]: With dead ends: 3026 [2024-10-11 06:15:30,676 INFO L226 Difference]: Without dead ends: 2047 [2024-10-11 06:15:30,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:15:30,682 INFO L432 NwaCegarLoop]: 1289 mSDtfsCounter, 1521 mSDsluCounter, 3738 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:30,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 5027 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 06:15:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2024-10-11 06:15:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1131. [2024-10-11 06:15:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.5017699115044247) internal successors, (1697), 1130 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1697 transitions. [2024-10-11 06:15:30,724 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1697 transitions. Word has length 90 [2024-10-11 06:15:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:30,726 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1697 transitions. [2024-10-11 06:15:30,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1697 transitions. [2024-10-11 06:15:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 06:15:30,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:30,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:30,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:15:30,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:30,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 556538662, now seen corresponding path program 1 times [2024-10-11 06:15:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:30,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424602171] [2024-10-11 06:15:30,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:15:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424602171] [2024-10-11 06:15:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424602171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:31,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:31,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:15:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093126608] [2024-10-11 06:15:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:31,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:15:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:15:31,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:15:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:15:31,303 INFO L87 Difference]: Start difference. First operand 1131 states and 1697 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:32,277 INFO L93 Difference]: Finished difference Result 2125 states and 3189 transitions. [2024-10-11 06:15:32,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:15:32,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-11 06:15:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:32,282 INFO L225 Difference]: With dead ends: 2125 [2024-10-11 06:15:32,283 INFO L226 Difference]: Without dead ends: 1146 [2024-10-11 06:15:32,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:15:32,288 INFO L432 NwaCegarLoop]: 1278 mSDtfsCounter, 1554 mSDsluCounter, 3823 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 5101 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:32,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 5101 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 06:15:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-10-11 06:15:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1144. [2024-10-11 06:15:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4978127734033246) internal successors, (1712), 1143 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1712 transitions. [2024-10-11 06:15:32,322 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1712 transitions. Word has length 91 [2024-10-11 06:15:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:32,322 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1712 transitions. [2024-10-11 06:15:32,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1712 transitions. [2024-10-11 06:15:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 06:15:32,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:32,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:15:32,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:15:32,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash 392176157, now seen corresponding path program 1 times [2024-10-11 06:15:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:15:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825182358] [2024-10-11 06:15:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:32,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:15:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:15:32,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:15:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:15:32,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:15:32,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:15:32,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:15:32,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:15:32,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:15:32,592 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:15:32,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:15:32 BoogieIcfgContainer [2024-10-11 06:15:32,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:15:32,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:15:32,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:15:32,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:15:32,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:26" (3/4) ... [2024-10-11 06:15:32,600 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:15:32,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:15:32,602 INFO L158 Benchmark]: Toolchain (without parser) took 12609.37ms. Allocated memory was 136.3MB in the beginning and 503.3MB in the end (delta: 367.0MB). Free memory was 84.1MB in the beginning and 254.8MB in the end (delta: -170.7MB). Peak memory consumption was 195.1MB. Max. memory is 16.1GB. [2024-10-11 06:15:32,603 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 92.3MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:15:32,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 820.79ms. Allocated memory is still 136.3MB. Free memory was 83.7MB in the beginning and 72.3MB in the end (delta: 11.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-11 06:15:32,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 490.01ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 72.3MB in the beginning and 117.0MB in the end (delta: -44.8MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-10-11 06:15:32,603 INFO L158 Benchmark]: Boogie Preprocessor took 625.01ms. Allocated memory is still 197.1MB. Free memory was 117.0MB in the beginning and 91.2MB in the end (delta: 25.8MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-10-11 06:15:32,605 INFO L158 Benchmark]: RCFGBuilder took 4485.09ms. Allocated memory was 197.1MB in the beginning and 379.6MB in the end (delta: 182.5MB). Free memory was 91.2MB in the beginning and 285.9MB in the end (delta: -194.6MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB. [2024-10-11 06:15:32,605 INFO L158 Benchmark]: TraceAbstraction took 6175.81ms. Allocated memory was 379.6MB in the beginning and 503.3MB in the end (delta: 123.7MB). Free memory was 285.9MB in the beginning and 254.8MB in the end (delta: 31.1MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. [2024-10-11 06:15:32,605 INFO L158 Benchmark]: Witness Printer took 5.91ms. Allocated memory is still 503.3MB. Free memory is still 254.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:15:32,609 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.10ms. Allocated memory is still 92.3MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 820.79ms. Allocated memory is still 136.3MB. Free memory was 83.7MB in the beginning and 72.3MB in the end (delta: 11.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 490.01ms. Allocated memory was 136.3MB in the beginning and 197.1MB in the end (delta: 60.8MB). Free memory was 72.3MB in the beginning and 117.0MB in the end (delta: -44.8MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 625.01ms. Allocated memory is still 197.1MB. Free memory was 117.0MB in the beginning and 91.2MB in the end (delta: 25.8MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * RCFGBuilder took 4485.09ms. Allocated memory was 197.1MB in the beginning and 379.6MB in the end (delta: 182.5MB). Free memory was 91.2MB in the beginning and 285.9MB in the end (delta: -194.6MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6175.81ms. Allocated memory was 379.6MB in the beginning and 503.3MB in the end (delta: 123.7MB). Free memory was 285.9MB in the beginning and 254.8MB in the end (delta: 31.1MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. * Witness Printer took 5.91ms. Allocated memory is still 503.3MB. Free memory is still 254.8MB. 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: 21]: 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 bitwiseAnd at line 173. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_3 var_59 = 0; [L41] const SORT_4 var_61 = 5; [L42] const SORT_2 var_65 = 2; [L43] const SORT_4 var_69 = 1; [L44] const SORT_2 var_75 = 4; [L45] const SORT_4 var_77 = 2; [L46] const SORT_2 var_101 = 12; [L47] const SORT_2 var_154 = 15; [L48] const SORT_2 var_169 = 10; [L50] SORT_1 input_66; [L51] SORT_1 input_76; [L52] SORT_1 input_82; [L53] SORT_1 input_106; [L54] SORT_1 input_109; [L55] SORT_1 input_110; [L56] SORT_1 input_126; [L57] SORT_1 input_145; [L58] SORT_1 input_187; [L59] SORT_1 input_208; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L61] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L62] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L63] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L64] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L65] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L66] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L67] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L68] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L69] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L70] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L71] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L72] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L73] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L74] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L75] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L76] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L77] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L78] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L79] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L80] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L81] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L82] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L83] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L84] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L85] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L86] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_2 init_7_arg_1 = var_5; [L89] state_6 = init_7_arg_1 [L90] SORT_2 init_9_arg_1 = var_5; [L91] state_8 = init_9_arg_1 [L92] SORT_2 init_11_arg_1 = var_5; [L93] state_10 = init_11_arg_1 [L94] SORT_2 init_13_arg_1 = var_5; [L95] state_12 = init_13_arg_1 [L96] SORT_2 init_15_arg_1 = var_5; [L97] state_14 = init_15_arg_1 [L98] SORT_2 init_17_arg_1 = var_5; [L99] state_16 = init_17_arg_1 [L100] SORT_2 init_19_arg_1 = var_5; [L101] state_18 = init_19_arg_1 [L102] SORT_2 init_21_arg_1 = var_5; [L103] state_20 = init_21_arg_1 [L104] SORT_2 init_23_arg_1 = var_5; [L105] state_22 = init_23_arg_1 [L106] SORT_2 init_25_arg_1 = var_5; [L107] state_24 = init_25_arg_1 [L108] SORT_2 init_27_arg_1 = var_5; [L109] state_26 = init_27_arg_1 [L110] SORT_2 init_29_arg_1 = var_5; [L111] state_28 = init_29_arg_1 [L112] SORT_1 init_32_arg_1 = var_30; [L113] state_31 = init_32_arg_1 [L114] SORT_1 init_34_arg_1 = var_30; [L115] state_33 = init_34_arg_1 [L116] SORT_1 init_36_arg_1 = var_30; [L117] state_35 = init_36_arg_1 [L118] SORT_1 init_38_arg_1 = var_30; [L119] state_37 = init_38_arg_1 [L120] SORT_1 init_40_arg_1 = var_30; [L121] state_39 = init_40_arg_1 [L122] SORT_1 init_42_arg_1 = var_30; [L123] state_41 = init_42_arg_1 [L124] SORT_1 init_44_arg_1 = var_30; [L125] state_43 = init_44_arg_1 [L126] SORT_1 init_46_arg_1 = var_30; [L127] state_45 = init_46_arg_1 [L128] SORT_1 init_48_arg_1 = var_30; [L129] state_47 = init_48_arg_1 [L130] SORT_1 init_50_arg_1 = var_30; [L131] state_49 = init_50_arg_1 [L132] SORT_1 init_52_arg_1 = var_30; [L133] state_51 = init_52_arg_1 [L134] SORT_1 init_54_arg_1 = var_30; [L135] state_53 = init_54_arg_1 [L136] SORT_1 init_56_arg_1 = var_30; [L137] state_55 = init_56_arg_1 [L138] SORT_1 init_58_arg_1 = var_30; [L139] state_57 = init_58_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L142] input_66 = __VERIFIER_nondet_uchar() [L143] EXPR input_66 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L143] input_66 = input_66 & mask_SORT_1 [L144] input_76 = __VERIFIER_nondet_uchar() [L145] EXPR input_76 & mask_SORT_1 VAL [input_66=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L145] input_76 = input_76 & mask_SORT_1 [L146] input_82 = __VERIFIER_nondet_uchar() [L147] EXPR input_82 & mask_SORT_1 VAL [input_66=0, input_76=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L147] input_82 = input_82 & mask_SORT_1 [L148] input_106 = __VERIFIER_nondet_uchar() [L149] EXPR input_106 & mask_SORT_1 VAL [input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L149] input_106 = input_106 & mask_SORT_1 [L150] input_109 = __VERIFIER_nondet_uchar() [L151] EXPR input_109 & mask_SORT_1 VAL [input_106=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L151] input_109 = input_109 & mask_SORT_1 [L152] input_110 = __VERIFIER_nondet_uchar() [L153] EXPR input_110 & mask_SORT_1 VAL [input_106=0, input_109=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L153] input_110 = input_110 & mask_SORT_1 [L154] input_126 = __VERIFIER_nondet_uchar() [L155] EXPR input_126 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L155] input_126 = input_126 & mask_SORT_1 [L156] input_145 = __VERIFIER_nondet_uchar() [L157] EXPR input_145 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L157] input_145 = input_145 & mask_SORT_1 [L158] input_187 = __VERIFIER_nondet_uchar() [L159] EXPR input_187 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L159] input_187 = input_187 & mask_SORT_1 [L160] input_208 = __VERIFIER_nondet_uchar() [L163] SORT_3 var_60_arg_0 = var_59; [L164] SORT_2 var_60_arg_1 = state_28; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60_arg_0=0, var_60_arg_1=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] EXPR ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] SORT_4 var_60 = ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1; [L166] EXPR var_60 & mask_SORT_4 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L166] var_60 = var_60 & mask_SORT_4 [L167] SORT_4 var_62_arg_0 = var_60; [L168] SORT_4 var_62_arg_1 = var_61; [L169] SORT_1 var_62 = var_62_arg_0 <= var_62_arg_1; [L170] SORT_1 var_63_arg_0 = ~state_57; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_63_arg_0=-1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L172] SORT_1 var_63_arg_1 = ~var_62; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_69=1, var_75=4, var_77=2] [L173] EXPR var_63_arg_1 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_65=2, var_69=1, var_75=4, var_77=2] [L173] var_63_arg_1 = var_63_arg_1 & mask_SORT_1 [L174] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L174] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L175] EXPR var_63 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L175] var_63 = var_63 & mask_SORT_1 [L176] SORT_1 bad_64_arg_0 = var_63; [L177] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1075 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3078 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3078 mSDsluCounter, 29443 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20424 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2715 IncrementalHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 9019 mSDtfsCounter, 2715 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1144occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 922 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 1523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-10-11 06:15:32,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:15:35,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:15:35,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:15:35,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:15:35,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:15:35,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:15:35,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:15:35,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:15:35,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:15:35,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:15:35,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:15:35,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:15:35,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:15:35,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:15:35,139 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:15:35,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:15:35,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:15:35,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:15:35,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:15:35,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:15:35,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:15:35,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:15:35,142 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:15:35,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:15:35,143 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:15:35,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:15:35,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:15:35,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:15:35,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:15:35,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:15:35,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:15:35,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:15:35,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:15:35,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:15:35,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:15:35,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:15:35,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:15:35,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:15:35,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:15:35,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:15:35,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:15:35,151 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:15:35,151 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2024-10-11 06:15:35,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:15:35,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:15:35,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:15:35,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:15:35,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:15:35,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-10-11 06:15:37,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:15:37,529 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:15:37,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-10-11 06:15:37,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e16e3c717/0cdabe5df94549488d1e3e41369f2e17/FLAG91f02893d [2024-10-11 06:15:37,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e16e3c717/0cdabe5df94549488d1e3e41369f2e17 [2024-10-11 06:15:37,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:15:37,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:15:37,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:15:37,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:15:37,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:15:37,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:37" (1/1) ... [2024-10-11 06:15:37,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6891a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:37, skipping insertion in model container [2024-10-11 06:15:37,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:37" (1/1) ... [2024-10-11 06:15:37,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:15:37,873 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-10-11 06:15:38,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:15:38,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:15:38,125 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c[1172,1185] [2024-10-11 06:15:38,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:15:38,249 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:15:38,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38 WrapperNode [2024-10-11 06:15:38,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:15:38,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:15:38,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:15:38,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:15:38,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,392 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1116 [2024-10-11 06:15:38,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:15:38,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:15:38,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:15:38,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:15:38,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,481 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-10-11 06:15:38,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:15:38,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:15:38,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:15:38,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:15:38,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (1/1) ... [2024-10-11 06:15:38,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:15:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:15:38,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:15:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:15:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:15:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:15:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:15:38,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:15:38,953 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:15:38,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:15:39,977 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-11 06:15:39,978 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:15:40,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:15:40,044 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:15:40,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:40 BoogieIcfgContainer [2024-10-11 06:15:40,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:15:40,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:15:40,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:15:40,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:15:40,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:15:37" (1/3) ... [2024-10-11 06:15:40,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42783ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:40, skipping insertion in model container [2024-10-11 06:15:40,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:38" (2/3) ... [2024-10-11 06:15:40,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42783ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:40, skipping insertion in model container [2024-10-11 06:15:40,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:40" (3/3) ... [2024-10-11 06:15:40,055 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-10-11 06:15:40,073 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:15:40,073 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:15:40,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:15:40,137 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;@15b10a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:15:40,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:15:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:15:40,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:40,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:15:40,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:15:40,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:15:40,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871233246] [2024-10-11 06:15:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:40,177 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-10-11 06:15:40,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:15:40,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 06:15:40,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 06:15:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:40,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 06:15:40,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:15:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:40,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:15:40,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:15:40,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871233246] [2024-10-11 06:15:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871233246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:15:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:15:40,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:15:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946479353] [2024-10-11 06:15:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:15:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:15:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:15:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:15:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:15:40,832 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:40,953 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:15:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:15:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:15:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:40,965 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:15:40,965 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:15:40,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 06:15:40,973 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:40,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:15:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:15:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:15:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:15:41,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:15:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:15:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:15:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:15:41,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:41,023 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:15:41,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 06:15:41,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 06:15:41,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:41,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:15:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:15:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502221996] [2024-10-11 06:15:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:15:41,231 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-10-11 06:15:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:15:41,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 06:15:41,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 06:15:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:15:41,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 06:15:41,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:15:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:41,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:15:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:15:51,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:15:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502221996] [2024-10-11 06:15:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502221996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:15:51,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:15:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 06:15:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671245546] [2024-10-11 06:15:51,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:15:51,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:15:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:15:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:15:51,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=60, Unknown=2, NotChecked=0, Total=90 [2024-10-11 06:15:51,744 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:15:54,610 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-11 06:15:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 06:15:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 06:15:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:15:54,612 INFO L225 Difference]: With dead ends: 17 [2024-10-11 06:15:54,612 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 06:15:54,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2024-10-11 06:15:54,613 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 06:15:54,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 06:15:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 06:15:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-11 06:15:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 06:15:54,619 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-11 06:15:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:15:54,620 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 06:15:54,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:15:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 06:15:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 06:15:54,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:15:54,629 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-11 06:15:54,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 06:15:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 06:15:54,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:15:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:15:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-11 06:15:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:15:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283565408] [2024-10-11 06:15:54,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 06:15:54,837 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-10-11 06:15:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:15:54,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 06:15:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Waiting until timeout for monitored process [2024-10-11 06:15:55,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 06:15:55,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:15:55,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 06:15:55,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:16:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:16:02,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:16:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:16:15,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:16:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283565408] [2024-10-11 06:16:15,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283565408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:16:15,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:16:15,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-11 06:16:15,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193894347] [2024-10-11 06:16:15,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:16:15,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 06:16:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:16:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 06:16:15,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:16:15,775 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:16:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:16:24,026 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-11 06:16:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 06:16:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 06:16:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:16:24,029 INFO L225 Difference]: With dead ends: 26 [2024-10-11 06:16:24,029 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 06:16:24,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2024-10-11 06:16:24,032 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:16:24,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 06:16:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 06:16:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-11 06:16:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:16:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-11 06:16:24,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 13 [2024-10-11 06:16:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:16:24,043 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-11 06:16:24,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:16:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-11 06:16:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 06:16:24,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:16:24,044 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2024-10-11 06:16:24,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 06:16:24,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 06:16:24,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:16:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:16:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -986749902, now seen corresponding path program 3 times [2024-10-11 06:16:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:16:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059239513] [2024-10-11 06:16:24,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 06:16:24,247 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-10-11 06:16:24,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:16:24,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 06:16:24,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Waiting until timeout for monitored process [2024-10-11 06:16:26,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 06:16:26,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:16:26,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-11 06:16:26,550 INFO L278 TraceCheckSpWp]: Computing forward predicates...