./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.pipeline.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pipeline.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5a1c69a049a9608f95ac90730c4f7554434241d21538bbd7cbbae38e9a8e04bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:20:45,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:20:45,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:20:45,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:20:45,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:20:45,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:20:45,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:20:45,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:20:45,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:20:45,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:20:45,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:20:45,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:20:45,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:20:45,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:20:45,850 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:20:45,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:20:45,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:20:45,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:20:45,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:20:45,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:20:45,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:20:45,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:20:45,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:20:45,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:20:45,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:20:45,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:20:45,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:20:45,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:20:45,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:20:45,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:20:45,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:20:45,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:20:45,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:20:45,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:20:45,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:20:45,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:20:45,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:20:45,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:20:45,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:20:45,858 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a1c69a049a9608f95ac90730c4f7554434241d21538bbd7cbbae38e9a8e04bb [2024-10-12 23:20:46,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:20:46,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:20:46,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:20:46,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:20:46,116 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:20:46,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pipeline.c [2024-10-12 23:20:47,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:20:47,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:20:47,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pipeline.c [2024-10-12 23:20:47,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b29d2e8b/88a100b7bc804a9eb7e077261cdd6ef7/FLAGb7a719920 [2024-10-12 23:20:47,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b29d2e8b/88a100b7bc804a9eb7e077261cdd6ef7 [2024-10-12 23:20:47,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:20:47,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:20:47,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:20:47,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:20:47,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:20:47,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:20:47" (1/1) ... [2024-10-12 23:20:47,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b74a27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:47, skipping insertion in model container [2024-10-12 23:20:47,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:20:47" (1/1) ... [2024-10-12 23:20:47,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:20:47,942 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.pipeline.c[1248,1261] [2024-10-12 23:20:47,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:20:47,991 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:20:48,002 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.pipeline.c[1248,1261] [2024-10-12 23:20:48,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:20:48,040 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:20:48,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48 WrapperNode [2024-10-12 23:20:48,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:20:48,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:20:48,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:20:48,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:20:48,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,098 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 214 [2024-10-12 23:20:48,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:20:48,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:20:48,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:20:48,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:20:48,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,138 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-12 23:20:48,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:20:48,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:20:48,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:20:48,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:20:48,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (1/1) ... [2024-10-12 23:20:48,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:20:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:20:48,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:20:48,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:20:48,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:20:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:20:48,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:20:48,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:20:48,385 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:20:48,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:20:48,757 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-10-12 23:20:48,757 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:20:48,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:20:48,781 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:20:48,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:20:48 BoogieIcfgContainer [2024-10-12 23:20:48,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:20:48,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:20:48,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:20:48,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:20:48,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:20:47" (1/3) ... [2024-10-12 23:20:48,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6817784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:20:48, skipping insertion in model container [2024-10-12 23:20:48,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:48" (2/3) ... [2024-10-12 23:20:48,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6817784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:20:48, skipping insertion in model container [2024-10-12 23:20:48,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:20:48" (3/3) ... [2024-10-12 23:20:48,793 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.pipeline.c [2024-10-12 23:20:48,810 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:20:48,811 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:20:48,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:20:48,870 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;@7295b60f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:20:48,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:20:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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-12 23:20:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 23:20:48,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:48,879 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-12 23:20:48,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:48,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -519714037, now seen corresponding path program 1 times [2024-10-12 23:20:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:20:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792994432] [2024-10-12 23:20:48,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:20:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:20:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:20:49,399 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-12 23:20:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:20:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792994432] [2024-10-12 23:20:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792994432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:20:49,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:20:49,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:20:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447353404] [2024-10-12 23:20:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:20:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:20:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:20:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:20:49,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:20:49,433 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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.5) 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-12 23:20:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:20:49,480 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2024-10-12 23:20:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:20:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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-12 23:20:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:20:49,491 INFO L225 Difference]: With dead ends: 90 [2024-10-12 23:20:49,491 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 23:20:49,494 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-12 23:20:49,499 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 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-12 23:20:49,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:20:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 23:20:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-12 23:20:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 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-12 23:20:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-10-12 23:20:49,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 22 [2024-10-12 23:20:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:20:49,532 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-10-12 23:20:49,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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-12 23:20:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-10-12 23:20:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 23:20:49,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:49,533 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-12 23:20:49,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:20:49,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:49,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1070429307, now seen corresponding path program 1 times [2024-10-12 23:20:49,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:20:49,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114249806] [2024-10-12 23:20:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:20:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:20:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:20:49,693 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-12 23:20:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:20:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114249806] [2024-10-12 23:20:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114249806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:20:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:20:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:20:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233181106] [2024-10-12 23:20:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:20:49,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:20:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:20:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:20:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:20:49,697 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:20:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:20:49,729 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2024-10-12 23:20:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:20:49,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 23:20:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:20:49,732 INFO L225 Difference]: With dead ends: 93 [2024-10-12 23:20:49,732 INFO L226 Difference]: Without dead ends: 58 [2024-10-12 23:20:49,733 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-12 23:20:49,734 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 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-12 23:20:49,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:20:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-12 23:20:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-12 23:20:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 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-12 23:20:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2024-10-12 23:20:49,741 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 23 [2024-10-12 23:20:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:20:49,741 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2024-10-12 23:20:49,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:20:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2024-10-12 23:20:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 23:20:49,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:49,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:20:49,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:20:49,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:49,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2020571620, now seen corresponding path program 1 times [2024-10-12 23:20:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:20:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197107657] [2024-10-12 23:20:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:20:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:20:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:20:50,182 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-12 23:20:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:20:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197107657] [2024-10-12 23:20:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197107657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:20:50,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:20:50,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:20:50,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872308612] [2024-10-12 23:20:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:20:50,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:20:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:20:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:20:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:20:50,187 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 23:20:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:20:50,267 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2024-10-12 23:20:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:20:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2024-10-12 23:20:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:20:50,268 INFO L225 Difference]: With dead ends: 99 [2024-10-12 23:20:50,268 INFO L226 Difference]: Without dead ends: 62 [2024-10-12 23:20:50,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:20:50,269 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:20:50,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 267 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:20:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-12 23:20:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-10-12 23:20:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 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-12 23:20:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2024-10-12 23:20:50,283 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 24 [2024-10-12 23:20:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:20:50,284 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2024-10-12 23:20:50,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 23:20:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2024-10-12 23:20:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 23:20:50,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:50,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:20:50,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:20:50,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:50,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash -222244002, now seen corresponding path program 1 times [2024-10-12 23:20:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:20:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982608640] [2024-10-12 23:20:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:20:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:20:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:20:50,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:20:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:20:50,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:20:50,411 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:20:50,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:20:50,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:20:50,416 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 23:20:50,448 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:20:50,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:20:50 BoogieIcfgContainer [2024-10-12 23:20:50,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:20:50,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:20:50,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:20:50,455 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:20:50,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:20:48" (3/4) ... [2024-10-12 23:20:50,458 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:20:50,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:20:50,459 INFO L158 Benchmark]: Toolchain (without parser) took 2710.39ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 93.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-12 23:20:50,459 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:20:50,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.67ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 80.6MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:20:50,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.67ms. Allocated memory is still 161.5MB. Free memory was 80.4MB in the beginning and 77.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:20:50,463 INFO L158 Benchmark]: Boogie Preprocessor took 69.41ms. Allocated memory is still 161.5MB. Free memory was 77.2MB in the beginning and 74.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:20:50,463 INFO L158 Benchmark]: RCFGBuilder took 609.11ms. Allocated memory is still 161.5MB. Free memory was 74.5MB in the beginning and 109.9MB in the end (delta: -35.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:20:50,464 INFO L158 Benchmark]: TraceAbstraction took 1668.86ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 93.0MB in the end (delta: 16.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-10-12 23:20:50,464 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 161.5MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:20:50,465 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.19ms. Allocated memory is still 98.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.67ms. Allocated memory is still 161.5MB. Free memory was 94.3MB in the beginning and 80.6MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.67ms. Allocated memory is still 161.5MB. Free memory was 80.4MB in the beginning and 77.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.41ms. Allocated memory is still 161.5MB. Free memory was 77.2MB in the beginning and 74.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 609.11ms. Allocated memory is still 161.5MB. Free memory was 74.5MB in the beginning and 109.9MB in the end (delta: -35.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1668.86ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 93.0MB in the end (delta: 16.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 161.5MB. Free memory is still 93.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 83. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 1); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (1 - 1); [L32] const SORT_1 var_8 = 0; [L33] const SORT_4 var_21 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L37] SORT_4 input_5; [L38] SORT_1 input_6; [L39] SORT_4 input_7; [L41] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, var_21=1, var_8=0] [L41] SORT_1 state_9 = __VERIFIER_nondet_uint() & mask_SORT_1; [L42] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, var_21=1, var_8=0] [L42] SORT_1 state_11 = __VERIFIER_nondet_uint() & mask_SORT_1; [L43] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, var_21=1, var_8=0] [L43] SORT_1 state_13 = __VERIFIER_nondet_uint() & mask_SORT_1; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, var_21=1, var_8=0] [L44] SORT_1 state_26 = __VERIFIER_nondet_uint() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, var_21=1, var_8=0] [L45] SORT_1 state_28 = __VERIFIER_nondet_uint() & mask_SORT_1; [L47] SORT_1 init_10_arg_1 = var_8; [L48] state_9 = init_10_arg_1 [L49] SORT_1 init_12_arg_1 = var_8; [L50] state_11 = init_12_arg_1 [L51] SORT_1 init_14_arg_1 = var_8; [L52] state_13 = init_14_arg_1 [L53] SORT_1 init_27_arg_1 = var_8; [L54] state_26 = init_27_arg_1 [L55] SORT_1 init_29_arg_1 = var_8; [L56] state_28 = init_29_arg_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, state_11=0, state_13=0, state_26=0, state_28=0, state_9=0, var_21=1, var_8=0] [L59] input_2 = __VERIFIER_nondet_uint() [L60] input_3 = __VERIFIER_nondet_uint() [L61] input_5 = __VERIFIER_nondet_uchar() [L62] input_6 = __VERIFIER_nondet_uint() [L63] input_7 = __VERIFIER_nondet_uchar() [L66] SORT_1 var_15_arg_0 = state_11; [L67] SORT_1 var_15_arg_1 = state_13; [L68] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, state_9=0, var_15=0, var_21=1, var_8=0] [L69] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, state_9=0, var_21=1, var_8=0] [L69] var_15 = var_15 & mask_SORT_1 [L70] SORT_1 var_16_arg_0 = state_9; [L71] SORT_1 var_16_arg_1 = var_15; [L72] SORT_4 var_16 = var_16_arg_0 == var_16_arg_1; [L73] SORT_1 var_17_arg_0 = state_9; [L74] SORT_1 var_17_arg_1 = var_8; [L75] SORT_4 var_17 = var_17_arg_0 == var_17_arg_1; [L76] SORT_4 var_18_arg_0 = var_16; [L77] SORT_4 var_18_arg_1 = var_17; VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_8=0] [L78] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, var_21=1, var_8=0] [L78] SORT_4 var_18 = var_18_arg_0 | var_18_arg_1; [L79] SORT_4 var_22_arg_0 = var_18; [L80] SORT_4 var_22 = ~var_22_arg_0; [L81] SORT_4 var_23_arg_0 = var_21; [L82] SORT_4 var_23_arg_1 = var_22; VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_8=0] [L83] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, var_21=1, var_8=0] [L83] SORT_4 var_23 = var_23_arg_0 & var_23_arg_1; [L84] EXPR var_23 & mask_SORT_4 VAL [mask_SORT_1=-1, mask_SORT_4=1, state_26=0, state_28=0, var_21=1, var_8=0] [L84] var_23 = var_23 & mask_SORT_4 [L85] SORT_4 bad_24_arg_0 = var_23; [L86] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 704 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 218 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 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-12 23:20:50,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pipeline.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5a1c69a049a9608f95ac90730c4f7554434241d21538bbd7cbbae38e9a8e04bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:20:52,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:20:52,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:20:52,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:20:52,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:20:52,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:20:52,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:20:52,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:20:52,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:20:52,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:20:52,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:20:52,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:20:52,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:20:52,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:20:52,734 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:20:52,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:20:52,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:20:52,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:20:52,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:20:52,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:20:52,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:20:52,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:20:52,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:20:52,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:20:52,742 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:20:52,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:20:52,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:20:52,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:20:52,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:20:52,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:20:52,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:20:52,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:20:52,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:20:52,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:20:52,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:20:52,745 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:20:52,745 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:20:52,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:20:52,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:20:52,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:20:52,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:20:52,747 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:20:52,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a1c69a049a9608f95ac90730c4f7554434241d21538bbd7cbbae38e9a8e04bb [2024-10-12 23:20:53,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:20:53,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:20:53,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:20:53,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:20:53,071 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:20:53,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pipeline.c [2024-10-12 23:20:54,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:20:54,808 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:20:54,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pipeline.c [2024-10-12 23:20:54,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cab24de5/b761d163d46042cbacc0b5984b873358/FLAG8c653fdbe [2024-10-12 23:20:54,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cab24de5/b761d163d46042cbacc0b5984b873358 [2024-10-12 23:20:54,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:20:54,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:20:54,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:20:54,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:20:54,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:20:54,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:20:54" (1/1) ... [2024-10-12 23:20:54,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59465c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:54, skipping insertion in model container [2024-10-12 23:20:54,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:20:54" (1/1) ... [2024-10-12 23:20:54,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:20:55,044 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.pipeline.c[1248,1261] [2024-10-12 23:20:55,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:20:55,103 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:20:55,116 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.pipeline.c[1248,1261] [2024-10-12 23:20:55,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:20:55,163 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:20:55,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55 WrapperNode [2024-10-12 23:20:55,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:20:55,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:20:55,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:20:55,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:20:55,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,223 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 118 [2024-10-12 23:20:55,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:20:55,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:20:55,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:20:55,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:20:55,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,259 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-12 23:20:55,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:20:55,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:20:55,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:20:55,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:20:55,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (1/1) ... [2024-10-12 23:20:55,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:20:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:20:55,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:20:55,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:20:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:20:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:20:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:20:55,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:20:55,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:20:55,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:20:55,646 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-12 23:20:55,650 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:20:55,682 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:20:55,682 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:20:55,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:20:55 BoogieIcfgContainer [2024-10-12 23:20:55,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:20:55,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:20:55,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:20:55,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:20:55,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:20:54" (1/3) ... [2024-10-12 23:20:55,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7579c955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:20:55, skipping insertion in model container [2024-10-12 23:20:55,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:20:55" (2/3) ... [2024-10-12 23:20:55,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7579c955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:20:55, skipping insertion in model container [2024-10-12 23:20:55,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:20:55" (3/3) ... [2024-10-12 23:20:55,692 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.pipeline.c [2024-10-12 23:20:55,706 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:20:55,706 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:20:55,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:20:55,781 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;@6b436bd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:20:55,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:20:55,785 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-12 23:20:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:20:55,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:55,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:20:55,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:20:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:20:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783741695] [2024-10-12 23:20:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:20:55,812 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-12 23:20:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:20:55,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:20:55,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:20:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:20:55,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 23:20:55,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:20:56,166 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-12 23:20:56,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:20:56,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:20:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783741695] [2024-10-12 23:20:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783741695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:20:56,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:20:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:20:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901598975] [2024-10-12 23:20:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:20:56,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:20:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:20:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:20:56,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:20:56,203 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-12 23:20:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:20:56,241 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-12 23:20:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:20:56,243 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-12 23:20:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:20:56,248 INFO L225 Difference]: With dead ends: 14 [2024-10-12 23:20:56,248 INFO L226 Difference]: Without dead ends: 8 [2024-10-12 23:20:56,250 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-12 23:20:56,253 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-12 23:20:56,254 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-12 23:20:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-12 23:20:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-12 23:20:56,274 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-12 23:20:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:20:56,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:20:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:20:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:20:56,276 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-12 23:20:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:20:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:20:56,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:56,277 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:20:56,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:20:56,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:20:56,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:20:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:20:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020980234] [2024-10-12 23:20:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:20:56,481 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-12 23:20:56,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:20:56,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:20:56,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:20:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:20:56,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 23:20:56,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:20:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:20:56,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:20:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:20:57,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:20:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020980234] [2024-10-12 23:20:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020980234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:20:57,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:20:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:20:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499930646] [2024-10-12 23:20:57,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:20:57,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:20:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:20:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:20:57,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:20:57,195 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:20:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:20:57,293 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-12 23:20:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:20:57,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 23:20:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:20:57,295 INFO L225 Difference]: With dead ends: 13 [2024-10-12 23:20:57,295 INFO L226 Difference]: Without dead ends: 11 [2024-10-12 23:20:57,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:20:57,297 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:20:57,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:20:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-12 23:20:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 23:20:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-12 23:20:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-12 23:20:57,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-12 23:20:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:20:57,303 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-12 23:20:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:20:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-12 23:20:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 23:20:57,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:20:57,305 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-12 23:20:57,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:20:57,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:20:57,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:20:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:20:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-12 23:20:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:20:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405767158] [2024-10-12 23:20:57,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:20:57,508 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-12 23:20:57,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:20:57,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:20:57,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:20:57,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:20:57,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:20:57,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 23:20:57,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:20:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 23:20:57,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:21:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 23:21:05,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:21:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405767158] [2024-10-12 23:21:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405767158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:21:05,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:21:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:21:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865408643] [2024-10-12 23:21:05,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:21:05,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:21:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:21:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:21:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2024-10-12 23:21:05,685 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-12 23:21:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:21:05,940 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-10-12 23:21:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:21:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 10 [2024-10-12 23:21:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:21:05,942 INFO L225 Difference]: With dead ends: 11 [2024-10-12 23:21:05,942 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 23:21:05,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=24, Invalid=47, Unknown=1, NotChecked=0, Total=72 [2024-10-12 23:21:05,943 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:21:05,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:21:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 23:21:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 23:21:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-12 23:21:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 23:21:05,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-12 23:21:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:21:05,947 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 23:21:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-12 23:21:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 23:21:05,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 23:21:05,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:21:05,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 23:21:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:21:06,158 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-12 23:21:06,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 23:21:06,705 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:21:06,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:21:06 BoogieIcfgContainer [2024-10-12 23:21:06,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:21:06,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:21:06,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:21:06,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:21:06,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:20:55" (3/4) ... [2024-10-12 23:21:06,723 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 23:21:06,730 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 23:21:06,731 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 23:21:06,731 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 23:21:06,731 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 23:21:06,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:21:06,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 23:21:06,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:21:06,814 INFO L158 Benchmark]: Toolchain (without parser) took 11982.94ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 44.5MB in the beginning and 61.2MB in the end (delta: -16.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,814 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 46.1MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:21:06,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.73ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 30.2MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.78ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 49.8MB in the end (delta: -19.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,815 INFO L158 Benchmark]: Boogie Preprocessor took 61.27ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 47.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,816 INFO L158 Benchmark]: RCFGBuilder took 394.68ms. Allocated memory is still 71.3MB. Free memory was 47.7MB in the beginning and 31.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,816 INFO L158 Benchmark]: TraceAbstraction took 11031.94ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 30.4MB in the beginning and 66.4MB in the end (delta: -36.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,816 INFO L158 Benchmark]: Witness Printer took 96.67ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 61.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:21:06,818 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.44ms. Allocated memory is still 46.1MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.73ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 30.2MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.78ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 49.8MB in the end (delta: -19.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.27ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 47.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.68ms. Allocated memory is still 71.3MB. Free memory was 47.7MB in the beginning and 31.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11031.94ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 30.4MB in the beginning and 66.4MB in the end (delta: -36.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 96.67ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 61.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 5 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 16, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 11 QuantifiedInterpolants, 1918 SizeOfPredicates, 13 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 8/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((0 == state_9) && (1 == mask_SORT_4)) && (0 == var_8)) || (((1 == mask_SORT_4) && (0 == var_8)) && (state_9 == (((state_13 + state_11) % 4294967296) & mask_SORT_1)))) RESULT: Ultimate proved your program to be correct! [2024-10-12 23:21:06,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE