./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.v_Unidec.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.v_Unidec.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 c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:58:01,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:58:01,765 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:58:01,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:58:01,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:58:01,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:58:01,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:58:01,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:58:01,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:58:01,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:58:01,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:58:01,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:58:01,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:58:01,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:58:01,801 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:58:01,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:58:01,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:58:01,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:58:01,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:58:01,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:58:01,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:58:01,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:58:01,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:58:01,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:58:01,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:58:01,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:58:01,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:58:01,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:58:01,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:58:01,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:01,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:58:01,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:58:01,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:58:01,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:58:01,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:58:01,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:58:01,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:58:01,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:58:01,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:58:01,811 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 -> c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 [2024-10-11 06:58:01,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:58:02,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:58:02,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:58:02,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:58:02,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:58:02,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2024-10-11 06:58:03,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:58:03,379 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:58:03,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2024-10-11 06:58:03,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b314a289e/e5b1f769baa34abea6873c940add2703/FLAGa95fe7a86 [2024-10-11 06:58:03,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b314a289e/e5b1f769baa34abea6873c940add2703 [2024-10-11 06:58:03,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:58:03,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:58:03,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:03,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:58:03,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:58:03,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:03" (1/1) ... [2024-10-11 06:58:03,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1816370c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:03, skipping insertion in model container [2024-10-11 06:58:03,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:03" (1/1) ... [2024-10-11 06:58:03,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:58:03,939 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.v_Unidec.c[1248,1261] [2024-10-11 06:58:04,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:04,111 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:58:04,119 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.v_Unidec.c[1248,1261] [2024-10-11 06:58:04,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:04,201 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:58:04,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04 WrapperNode [2024-10-11 06:58:04,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:04,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:04,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:58:04,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:58:04,208 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:58:04" (1/1) ... [2024-10-11 06:58:04,232 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:58:04" (1/1) ... [2024-10-11 06:58:04,376 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1220 [2024-10-11 06:58:04,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:04,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:58:04,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:58:04,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:58:04,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,457 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:58:04,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:58:04,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:58:04,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:58:04,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:58:04,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (1/1) ... [2024-10-11 06:58:04,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:58:04,563 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:58:04,565 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:58:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:58:04,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:58:04,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:58:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:58:04,783 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:58:04,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:58:05,851 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-10-11 06:58:05,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:58:05,887 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:58:05,887 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:58:05,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:05 BoogieIcfgContainer [2024-10-11 06:58:05,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:58:05,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:58:05,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:58:05,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:58:05,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:58:03" (1/3) ... [2024-10-11 06:58:05,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575037b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:05, skipping insertion in model container [2024-10-11 06:58:05,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:04" (2/3) ... [2024-10-11 06:58:05,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575037b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:05, skipping insertion in model container [2024-10-11 06:58:05,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:05" (3/3) ... [2024-10-11 06:58:05,898 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_Unidec.c [2024-10-11 06:58:05,910 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:58:05,910 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:58:05,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:58:05,965 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;@4d6298c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:58:05,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:58:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.501779359430605) internal successors, (422), 282 states have internal predecessors, (422), 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:58:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 06:58:05,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:05,974 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] [2024-10-11 06:58:05,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:05,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1141713301, now seen corresponding path program 1 times [2024-10-11 06:58:05,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524767186] [2024-10-11 06:58:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:06,397 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:58:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:06,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524767186] [2024-10-11 06:58:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524767186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:06,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:06,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:58:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925575343] [2024-10-11 06:58:06,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:06,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:58:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:58:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:06,428 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.501779359430605) internal successors, (422), 282 states have internal predecessors, (422), 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 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:58:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:06,507 INFO L93 Difference]: Finished difference Result 554 states and 828 transitions. [2024-10-11 06:58:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:06,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-10-11 06:58:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:06,521 INFO L225 Difference]: With dead ends: 554 [2024-10-11 06:58:06,521 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 06:58:06,526 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:58:06,528 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 0 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1246 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:58:06,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1246 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 06:58:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-11 06:58:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4911660777385158) internal successors, (422), 283 states have internal predecessors, (422), 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:58:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 422 transitions. [2024-10-11 06:58:06,567 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 422 transitions. Word has length 20 [2024-10-11 06:58:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:06,570 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 422 transitions. [2024-10-11 06:58:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:58:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 422 transitions. [2024-10-11 06:58:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 06:58:06,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:06,572 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] [2024-10-11 06:58:06,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:58:06,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:06,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1031678706, now seen corresponding path program 1 times [2024-10-11 06:58:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:06,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779634495] [2024-10-11 06:58:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:06,706 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:58:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:06,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779634495] [2024-10-11 06:58:06,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779634495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:06,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:06,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:58:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085691789] [2024-10-11 06:58:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:06,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:58:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:58:06,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:06,713 INFO L87 Difference]: Start difference. First operand 284 states and 422 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:58:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:06,753 INFO L93 Difference]: Finished difference Result 557 states and 828 transitions. [2024-10-11 06:58:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-10-11 06:58:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:06,760 INFO L225 Difference]: With dead ends: 557 [2024-10-11 06:58:06,760 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 06:58:06,760 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:58:06,761 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1243 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:58:06,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1243 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 06:58:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-11 06:58:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.487719298245614) internal successors, (424), 285 states have internal predecessors, (424), 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:58:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 424 transitions. [2024-10-11 06:58:06,773 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 424 transitions. Word has length 21 [2024-10-11 06:58:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:06,775 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 424 transitions. [2024-10-11 06:58:06,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:58:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 424 transitions. [2024-10-11 06:58:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 06:58:06,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:06,776 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] [2024-10-11 06:58:06,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:58:06,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1279732644, now seen corresponding path program 1 times [2024-10-11 06:58:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973690295] [2024-10-11 06:58:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:06,979 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:58:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:58:06,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973690295] [2024-10-11 06:58:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973690295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:58:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135396771] [2024-10-11 06:58:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:58:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:58:06,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:58:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:58:06,982 INFO L87 Difference]: Start difference. First operand 286 states and 424 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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:58:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:07,015 INFO L93 Difference]: Finished difference Result 557 states and 827 transitions. [2024-10-11 06:58:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-10-11 06:58:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:07,017 INFO L225 Difference]: With dead ends: 557 [2024-10-11 06:58:07,017 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 06:58:07,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:58:07,020 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 407 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:07,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1234 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 06:58:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-11 06:58:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4840989399293287) internal successors, (420), 283 states have internal predecessors, (420), 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:58:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 420 transitions. [2024-10-11 06:58:07,028 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 420 transitions. Word has length 22 [2024-10-11 06:58:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:07,028 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 420 transitions. [2024-10-11 06:58:07,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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:58:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 420 transitions. [2024-10-11 06:58:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 06:58:07,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:07,032 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] [2024-10-11 06:58:07,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:58:07,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1713415791, now seen corresponding path program 1 times [2024-10-11 06:58:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:58:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498284187] [2024-10-11 06:58:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:58:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:58:07,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:58:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:58:07,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:58:07,124 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:58:07,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:58:07,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:58:07,128 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 06:58:07,183 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:58:07,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:58:07 BoogieIcfgContainer [2024-10-11 06:58:07,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:58:07,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:58:07,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:58:07,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:58:07,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:05" (3/4) ... [2024-10-11 06:58:07,191 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:58:07,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:58:07,193 INFO L158 Benchmark]: Toolchain (without parser) took 3436.83ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 114.7MB in the beginning and 105.2MB in the end (delta: 9.5MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2024-10-11 06:58:07,193 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:58:07,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.97ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 81.7MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 06:58:07,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 174.39ms. Allocated memory is still 184.5MB. Free memory was 81.7MB in the beginning and 128.7MB in the end (delta: -46.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 06:58:07,194 INFO L158 Benchmark]: Boogie Preprocessor took 151.23ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 111.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 06:58:07,194 INFO L158 Benchmark]: RCFGBuilder took 1358.42ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 92.4MB in the end (delta: 19.3MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2024-10-11 06:58:07,194 INFO L158 Benchmark]: TraceAbstraction took 1295.74ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 92.4MB in the beginning and 106.3MB in the end (delta: -13.8MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2024-10-11 06:58:07,194 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 293.6MB. Free memory was 106.3MB in the beginning and 105.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:58:07,196 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.16ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.97ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 81.7MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 174.39ms. Allocated memory is still 184.5MB. Free memory was 81.7MB in the beginning and 128.7MB in the end (delta: -46.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 151.23ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 111.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1358.42ms. Allocated memory is still 184.5MB. Free memory was 111.8MB in the beginning and 92.4MB in the end (delta: 19.3MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1295.74ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 92.4MB in the beginning and 106.3MB in the end (delta: -13.8MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 293.6MB. Free memory was 106.3MB in the beginning and 105.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 161. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L38] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 16); [L39] const SORT_22 msb_SORT_22 = (SORT_22)1 << (16 - 1); [L41] const SORT_68 mask_SORT_68 = (SORT_68)-1 >> (sizeof(SORT_68) * 8 - 13); [L42] const SORT_68 msb_SORT_68 = (SORT_68)1 << (13 - 1); [L44] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 6); [L45] const SORT_71 msb_SORT_71 = (SORT_71)1 << (6 - 1); [L47] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 10); [L48] const SORT_73 msb_SORT_73 = (SORT_73)1 << (10 - 1); [L50] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 9); [L51] const SORT_79 msb_SORT_79 = (SORT_79)1 << (9 - 1); [L53] const SORT_81 mask_SORT_81 = (SORT_81)-1 >> (sizeof(SORT_81) * 8 - 7); [L54] const SORT_81 msb_SORT_81 = (SORT_81)1 << (7 - 1); [L56] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 12); [L57] const SORT_84 msb_SORT_84 = (SORT_84)1 << (12 - 1); [L59] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L60] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L62] const SORT_1 var_7 = 0; [L63] const SORT_10 var_12 = 0; [L64] const SORT_1 var_16 = 1; [L65] const SORT_22 var_23 = 8; [L66] const SORT_22 var_24 = 10; [L67] const SORT_3 var_25 = 1; [L68] const SORT_22 var_28 = 88; [L69] const SORT_22 var_29 = 584; [L70] const SORT_3 var_30 = 3; [L71] const SORT_3 var_33 = 2; [L72] const SORT_22 var_37 = 705; [L73] const SORT_22 var_38 = 611; [L74] const SORT_3 var_39 = 5; [L75] const SORT_22 var_42 = 50825; [L76] const SORT_3 var_43 = 7; [L77] const SORT_3 var_46 = 6; [L78] const SORT_3 var_50 = 4; [L79] const SORT_22 var_65 = 0; [L80] const SORT_3 var_67 = 0; [L81] const SORT_71 var_72 = 0; [L82] const SORT_5 var_76 = 1; [L83] const SORT_79 var_80 = 0; [L84] const SORT_84 var_85 = 0; [L85] const SORT_5 var_89 = 3; [L86] const SORT_5 var_92 = 2; [L87] const SORT_68 var_97 = 1; [L88] const SORT_22 var_100 = 32767; [L89] const SORT_5 var_105 = 0; [L90] const SORT_73 var_119 = 1; [L91] const SORT_81 var_131 = 1; [L92] const SORT_86 var_141 = 1; [L94] SORT_1 input_2; [L95] SORT_3 input_4; [L96] SORT_5 input_6; [L97] SORT_22 input_66; [L98] SORT_22 input_96; [L99] SORT_22 input_108; [L100] SORT_22 input_109; [L101] SORT_22 input_118; [L102] SORT_22 input_130; [L103] SORT_22 input_140; [L104] SORT_22 input_157; [L105] SORT_22 input_166; [L106] SORT_22 input_170; [L107] SORT_22 input_179; [L108] SORT_22 input_181; [L109] SORT_22 input_190; [L110] SORT_22 input_197; [L111] SORT_22 input_201; [L112] SORT_22 input_204; [L113] SORT_22 input_206; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L115] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L116] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_22 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L117] SORT_22 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_22; [L119] SORT_1 init_9_arg_1 = var_7; [L120] state_8 = init_9_arg_1 [L121] SORT_1 init_21_arg_1 = var_16; [L122] state_20 = init_21_arg_1 [L123] SORT_22 init_59_arg_1 = var_23; [L124] state_58 = init_59_arg_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L129] input_4 = input_4 & mask_SORT_3 [L130] input_6 = __VERIFIER_nondet_uchar() [L131] EXPR input_6 & mask_SORT_5 VAL [input_4=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L131] input_6 = input_6 & mask_SORT_5 [L132] input_66 = __VERIFIER_nondet_ushort() [L133] input_96 = __VERIFIER_nondet_ushort() [L134] input_108 = __VERIFIER_nondet_ushort() [L135] input_109 = __VERIFIER_nondet_ushort() [L136] input_118 = __VERIFIER_nondet_ushort() [L137] input_130 = __VERIFIER_nondet_ushort() [L138] input_140 = __VERIFIER_nondet_ushort() [L139] input_157 = __VERIFIER_nondet_ushort() [L140] input_166 = __VERIFIER_nondet_ushort() [L141] input_170 = __VERIFIER_nondet_ushort() [L142] input_179 = __VERIFIER_nondet_ushort() [L143] input_181 = __VERIFIER_nondet_ushort() [L144] input_190 = __VERIFIER_nondet_ushort() [L145] input_197 = __VERIFIER_nondet_ushort() [L146] input_201 = __VERIFIER_nondet_ushort() [L147] input_204 = __VERIFIER_nondet_ushort() [L148] input_206 = __VERIFIER_nondet_ushort() [L151] SORT_1 var_11_arg_0 = state_8; VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_11_arg_0=0, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L152] EXPR var_11_arg_0 & mask_SORT_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L152] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L153] SORT_10 var_11 = var_11_arg_0; [L154] SORT_10 var_13_arg_0 = var_11; [L155] SORT_10 var_13_arg_1 = var_12; [L156] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L157] SORT_1 var_17_arg_0 = var_13; [L158] SORT_1 var_17 = ~var_17_arg_0; [L159] SORT_1 var_18_arg_0 = var_16; [L160] SORT_1 var_18_arg_1 = var_17; VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_18_arg_0=1, var_18_arg_1=-2, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L161] EXPR var_18_arg_0 & var_18_arg_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L161] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L162] EXPR var_18 & mask_SORT_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L162] var_18 = var_18 & mask_SORT_1 [L163] SORT_1 bad_19_arg_0 = var_18; [L164] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 3723 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2477 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1246 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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:58:07,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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.v_Unidec.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 c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:58:09,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:58:09,076 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:58:09,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:58:09,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:58:09,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:58:09,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:58:09,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:58:09,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:58:09,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:58:09,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:58:09,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:58:09,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:58:09,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:58:09,106 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:58:09,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:58:09,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:58:09,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:58:09,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:58:09,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:58:09,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:58:09,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:58:09,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:58:09,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:58:09,109 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:58:09,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:58:09,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:58:09,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:58:09,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:58:09,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:58:09,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:58:09,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:09,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:58:09,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:58:09,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:58:09,112 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:58:09,112 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:58:09,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:58:09,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:58:09,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:58:09,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:58:09,114 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:58:09,114 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 -> c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 [2024-10-11 06:58:09,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:58:09,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:58:09,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:58:09,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:58:09,405 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:58:09,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2024-10-11 06:58:10,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:58:10,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:58:10,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2024-10-11 06:58:10,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef2f5afc6/a13aae6b9dad42c4bea46b99be58d073/FLAG29401e648 [2024-10-11 06:58:10,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef2f5afc6/a13aae6b9dad42c4bea46b99be58d073 [2024-10-11 06:58:10,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:58:10,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:58:10,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:10,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:58:10,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:58:10,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:10" (1/1) ... [2024-10-11 06:58:10,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5e346c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:10, skipping insertion in model container [2024-10-11 06:58:10,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:58:10" (1/1) ... [2024-10-11 06:58:10,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:58:11,140 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.v_Unidec.c[1248,1261] [2024-10-11 06:58:11,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:11,304 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:58:11,312 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.v_Unidec.c[1248,1261] [2024-10-11 06:58:11,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:58:11,416 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:58:11,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11 WrapperNode [2024-10-11 06:58:11,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:58:11,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:11,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:58:11,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:58:11,424 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:58:11" (1/1) ... [2024-10-11 06:58:11,445 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:58:11" (1/1) ... [2024-10-11 06:58:11,493 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-10-11 06:58:11,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:58:11,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:58:11,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:58:11,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:58:11,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,535 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:58:11,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:58:11,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:58:11,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:58:11,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:58:11,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (1/1) ... [2024-10-11 06:58:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:58:11,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:58:11,626 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:58:11,629 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:58:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:58:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:58:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:58:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:58:11,820 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:58:11,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:58:12,488 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-11 06:58:12,488 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:58:12,524 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:58:12,525 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:58:12,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:12 BoogieIcfgContainer [2024-10-11 06:58:12,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:58:12,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:58:12,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:58:12,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:58:12,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:58:10" (1/3) ... [2024-10-11 06:58:12,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669cb3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:12, skipping insertion in model container [2024-10-11 06:58:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:58:11" (2/3) ... [2024-10-11 06:58:12,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669cb3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:58:12, skipping insertion in model container [2024-10-11 06:58:12,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:58:12" (3/3) ... [2024-10-11 06:58:12,533 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_Unidec.c [2024-10-11 06:58:12,545 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:58:12,545 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:58:12,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:58:12,591 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;@76d76d5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:58:12,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:58:12,595 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:58:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:58:12,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:12,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:58:12,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:58:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:58:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114498326] [2024-10-11 06:58:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:12,616 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:58:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:58:12,619 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:58:12,620 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:58:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:12,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 06:58:12,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:58:12,903 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:58:12,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:58:12,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:58:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114498326] [2024-10-11 06:58:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114498326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:58:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:58:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:58:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038138571] [2024-10-11 06:58:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:58:12,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:58:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:58:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:58:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:58:12,928 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:58:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:58:12,968 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-11 06:58:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:58:12,974 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:58:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:58:12,979 INFO L225 Difference]: With dead ends: 14 [2024-10-11 06:58:12,979 INFO L226 Difference]: Without dead ends: 8 [2024-10-11 06:58:12,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:58:12,984 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:58:12,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:58:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-11 06:58:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-11 06:58:13,003 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:58:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:58:13,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:58:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:58:13,005 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:58:13,005 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:58:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:58:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:58:13,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:58:13,005 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:58:13,008 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:58:13,206 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:58:13,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:58:13,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:58:13,207 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:58:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:58:13,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318268075] [2024-10-11 06:58:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:58:13,208 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:58:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:58:13,210 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:58:13,210 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:58:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:58:13,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 06:58:13,492 INFO L278 TraceCheckSpWp]: Computing forward predicates...