./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:43:27,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:43:27,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:43:27,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:43:27,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:43:27,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:43:27,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:43:27,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:43:27,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:43:27,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:43:27,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:43:27,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:43:27,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:43:27,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:43:27,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:43:27,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:43:27,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:43:27,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:43:27,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:43:27,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:43:27,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:43:27,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:43:27,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:43:27,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:43:27,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:43:27,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:43:27,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:43:27,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:43:27,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:43:27,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:43:27,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:43:27,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:43:27,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:43:27,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:43:27,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:43:27,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:43:27,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:43:27,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:43:27,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:43:27,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:43:27,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:43:27,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:43:27,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e [2024-11-22 10:43:28,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:43:28,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:43:28,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:43:28,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:43:28,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:43:28,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-11-22 10:43:29,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:43:29,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:43:29,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-11-22 10:43:29,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cfdfe1f/9ad75c0787d643399435189719ad6ed5/FLAG7cb7511f2 [2024-11-22 10:43:29,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0cfdfe1f/9ad75c0787d643399435189719ad6ed5 [2024-11-22 10:43:29,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:43:29,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:43:29,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:43:29,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:43:29,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:43:29,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:29,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7389ba30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29, skipping insertion in model container [2024-11-22 10:43:29,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:29,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:43:29,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-11-22 10:43:29,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:43:29,927 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:43:29,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-11-22 10:43:29,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:43:29,986 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:43:29,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29 WrapperNode [2024-11-22 10:43:29,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:43:29,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:43:29,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:43:29,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:43:29,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,018 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-22 10:43:30,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:43:30,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:43:30,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:43:30,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:43:30,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,049 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:43:30,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:43:30,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:43:30,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:43:30,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:43:30,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (1/1) ... [2024-11-22 10:43:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:43:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:43:30,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:43:30,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:43:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:43:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:43:30,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:43:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:43:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:43:30,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:43:30,197 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:43:30,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:43:30,443 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-22 10:43:30,443 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:43:30,455 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:43:30,456 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:43:30,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:43:30 BoogieIcfgContainer [2024-11-22 10:43:30,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:43:30,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:43:30,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:43:30,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:43:30,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:43:29" (1/3) ... [2024-11-22 10:43:30,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cdeeac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:43:30, skipping insertion in model container [2024-11-22 10:43:30,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:29" (2/3) ... [2024-11-22 10:43:30,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cdeeac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:43:30, skipping insertion in model container [2024-11-22 10:43:30,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:43:30" (3/3) ... [2024-11-22 10:43:30,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-11-22 10:43:30,479 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:43:30,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:43:30,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:43:30,539 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;@2efb588a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:43:30,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:43:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:43:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 10:43:30,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:30,551 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:30,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:30,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash -700993566, now seen corresponding path program 1 times [2024-11-22 10:43:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:43:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890444684] [2024-11-22 10:43:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:43:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 10:43:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:43:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890444684] [2024-11-22 10:43:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890444684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:43:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612173754] [2024-11-22 10:43:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:43:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:43:30,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:43:30,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:43:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:30,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:43:30,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:43:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 10:43:30,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:43:30,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612173754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:43:30,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:43:30,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:43:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29684659] [2024-11-22 10:43:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:43:30,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:43:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:43:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:43:30,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:43:30,931 INFO L87 Difference]: Start difference. First operand has 56 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:43:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:43:30,953 INFO L93 Difference]: Finished difference Result 109 states and 173 transitions. [2024-11-22 10:43:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:43:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-22 10:43:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:43:30,983 INFO L225 Difference]: With dead ends: 109 [2024-11-22 10:43:30,983 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 10:43:30,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:43:30,995 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:43:30,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:43:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 10:43:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-22 10:43:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:43:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-22 10:43:31,059 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 94 [2024-11-22 10:43:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:43:31,063 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-22 10:43:31,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:43:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-22 10:43:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 10:43:31,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:31,066 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:31,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:43:31,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:43:31,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:31,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2066036310, now seen corresponding path program 1 times [2024-11-22 10:43:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:43:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363765561] [2024-11-22 10:43:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:43:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:43:31,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:43:31,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363765561] [2024-11-22 10:43:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363765561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:43:31,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:43:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 10:43:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480751655] [2024-11-22 10:43:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:43:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 10:43:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:43:31,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 10:43:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 10:43:31,616 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:43:31,693 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-11-22 10:43:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:43:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-22 10:43:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:43:31,697 INFO L225 Difference]: With dead ends: 121 [2024-11-22 10:43:31,697 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 10:43:31,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:43:31,699 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 21 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:43:31,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 187 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:43:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 10:43:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2024-11-22 10:43:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:43:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-22 10:43:31,707 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 94 [2024-11-22 10:43:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:43:31,708 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-22 10:43:31,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-22 10:43:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 10:43:31,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:31,710 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:31,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:43:31,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:31,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:31,711 INFO L85 PathProgramCache]: Analyzing trace with hash 83114635, now seen corresponding path program 1 times [2024-11-22 10:43:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:43:31,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154648530] [2024-11-22 10:43:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:31,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:43:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:43:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:43:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154648530] [2024-11-22 10:43:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154648530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:43:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875880767] [2024-11-22 10:43:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:31,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:43:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:43:31,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:43:31,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 10:43:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:32,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 10:43:32,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:43:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-22 10:43:32,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:43:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:43:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875880767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:43:32,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:43:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2024-11-22 10:43:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532008128] [2024-11-22 10:43:32,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:43:32,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 10:43:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:43:32,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 10:43:32,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:43:32,588 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-22 10:43:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:43:32,974 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2024-11-22 10:43:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 10:43:32,974 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 95 [2024-11-22 10:43:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:43:32,976 INFO L225 Difference]: With dead ends: 235 [2024-11-22 10:43:32,976 INFO L226 Difference]: Without dead ends: 177 [2024-11-22 10:43:32,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2024-11-22 10:43:32,978 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 431 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:43:32,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 215 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:43:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-22 10:43:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2024-11-22 10:43:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 10:43:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2024-11-22 10:43:32,994 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 95 [2024-11-22 10:43:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:43:32,995 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 194 transitions. [2024-11-22 10:43:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-22 10:43:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2024-11-22 10:43:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 10:43:32,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:32,997 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:33,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 10:43:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 10:43:33,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash 810160421, now seen corresponding path program 1 times [2024-11-22 10:43:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:43:33,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851229795] [2024-11-22 10:43:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:43:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:43:33,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362216227] [2024-11-22 10:43:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:33,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:43:33,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:43:33,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:43:33,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:43:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:33,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:43:33,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:43:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:43:33,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:43:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:43:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851229795] [2024-11-22 10:43:33,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:43:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362216227] [2024-11-22 10:43:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362216227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:43:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:43:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:43:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706462213] [2024-11-22 10:43:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:43:33,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:43:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:43:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:43:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:43:33,625 INFO L87 Difference]: Start difference. First operand 134 states and 194 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:43:33,775 INFO L93 Difference]: Finished difference Result 301 states and 435 transitions. [2024-11-22 10:43:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:43:33,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-22 10:43:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:43:33,780 INFO L225 Difference]: With dead ends: 301 [2024-11-22 10:43:33,781 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 10:43:33,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:43:33,784 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:43:33,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 276 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:43:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 10:43:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-22 10:43:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 120 states have internal predecessors, (157), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-22 10:43:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2024-11-22 10:43:33,811 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 96 [2024-11-22 10:43:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:43:33,812 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2024-11-22 10:43:33,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2024-11-22 10:43:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:43:33,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:33,814 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:33,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:43:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:43:34,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:34,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -373399000, now seen corresponding path program 1 times [2024-11-22 10:43:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:43:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757842925] [2024-11-22 10:43:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:43:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:43:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:43:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757842925] [2024-11-22 10:43:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757842925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:43:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:43:34,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:43:34,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436735736] [2024-11-22 10:43:34,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:43:34,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:43:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:43:34,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:43:34,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:43:34,408 INFO L87 Difference]: Start difference. First operand 168 states and 241 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:43:34,728 INFO L93 Difference]: Finished difference Result 365 states and 513 transitions. [2024-11-22 10:43:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:43:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-22 10:43:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:43:34,730 INFO L225 Difference]: With dead ends: 365 [2024-11-22 10:43:34,731 INFO L226 Difference]: Without dead ends: 234 [2024-11-22 10:43:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:43:34,735 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 109 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:43:34,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 473 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:43:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-22 10:43:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2024-11-22 10:43:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 156 states have (on average 1.2435897435897436) internal successors, (194), 158 states have internal predecessors, (194), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-22 10:43:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 292 transitions. [2024-11-22 10:43:34,769 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 292 transitions. Word has length 98 [2024-11-22 10:43:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:43:34,769 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 292 transitions. [2024-11-22 10:43:34,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 292 transitions. [2024-11-22 10:43:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 10:43:34,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:34,773 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:34,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:43:34,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:34,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:34,773 INFO L85 PathProgramCache]: Analyzing trace with hash -64370369, now seen corresponding path program 1 times [2024-11-22 10:43:34,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:43:34,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565340793] [2024-11-22 10:43:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:43:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:43:34,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146652561] [2024-11-22 10:43:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:34,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:43:34,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:43:34,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:43:34,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 10:43:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:43:34,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:43:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:43:34,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:43:34,944 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:43:34,945 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:43:34,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 10:43:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:43:35,150 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 10:43:35,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:43:35,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:43:35 BoogieIcfgContainer [2024-11-22 10:43:35,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:43:35,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:43:35,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:43:35,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:43:35,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:43:30" (3/4) ... [2024-11-22 10:43:35,226 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:43:35,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:43:35,227 INFO L158 Benchmark]: Toolchain (without parser) took 5502.80ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 89.1MB in the beginning and 208.5MB in the end (delta: -119.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:43:35,228 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:43:35,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.84ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 130.3MB in the end (delta: -41.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-22 10:43:35,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 159.4MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:43:35,228 INFO L158 Benchmark]: Boogie Preprocessor took 44.07ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:43:35,228 INFO L158 Benchmark]: RCFGBuilder took 392.96ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 110.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:43:35,228 INFO L158 Benchmark]: TraceAbstraction took 4765.42ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 109.4MB in the beginning and 209.5MB in the end (delta: -100.2MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-11-22 10:43:35,229 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 247.5MB. Free memory was 209.5MB in the beginning and 208.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:43:35,230 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.12ms. Allocated memory is still 109.1MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.84ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 130.3MB in the end (delta: -41.4MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 159.4MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.07ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.96ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 110.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4765.42ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 109.4MB in the beginning and 209.5MB in the end (delta: -100.2MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 247.5MB. Free memory was 209.5MB in the beginning and 208.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of shiftRight at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] signed long int var_1_9 = 25; [L27] double var_1_10 = 0.75; [L28] signed long int var_1_11 = 2; [L29] signed long int var_1_12 = 32; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] double var_1_15 = 50.2; [L33] signed long int last_1_var_1_9 = 25; [L34] double last_1_var_1_10 = 0.75; VAL [isInitial=0, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L98] isInitial = 1 [L99] FCALL initially() [L100] int k_loop; [L101] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L101] COND TRUE k_loop < 1 [L102] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L91] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L67] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L70] var_1_8 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L71] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L75] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L77] var_1_12 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L78] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L83] var_1_14 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L84] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L86] var_1_15 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L87] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L103] RET updateVariables() [L104] CALL step() [L38] signed long int stepLocal_0 = last_1_var_1_9 + last_1_var_1_9; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L39] COND FALSE !((var_1_2 - var_1_3) >= last_1_var_1_10) [L44] var_1_1 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L46] signed long int stepLocal_2 = var_1_1; [L47] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] COND FALSE !((var_1_8 >> last_1_var_1_9) > stepLocal_1) [L55] var_1_9 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L57] COND TRUE ((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12)) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L58] COND TRUE var_1_13 || var_1_14 [L59] var_1_10 = var_1_15 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L104] RET step() [L105] CALL, EXPR property() [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94-L95] return ((((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9)))) && ((((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12))) ? ((var_1_13 || var_1_14) ? (var_1_10 == ((double) var_1_15)) : (var_1_10 == ((double) var_1_15))) : 1) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 598 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 875 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 354 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 75 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2303 SizeOfPredicates, 7 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2805/2912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:43:35,249 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 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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:43:37,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:43:37,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:43:37,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:43:37,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:43:37,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:43:37,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:43:37,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:43:37,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:43:37,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:43:37,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:43:37,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:43:37,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:43:37,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:43:37,370 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:43:37,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:43:37,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:43:37,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:43:37,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:43:37,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:43:37,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:43:37,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:43:37,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:43:37,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:43:37,373 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:43:37,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:43:37,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:43:37,374 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:43:37,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:43:37,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:43:37,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:43:37,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:43:37,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:43:37,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:43:37,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:43:37,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:43:37,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:43:37,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:43:37,388 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:43:37,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:43:37,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:43:37,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:43:37,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:43:37,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:43:37,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4fd4ec86d0542e34aa772f57fe8fd3f67e11de6063cb3b9506f2b9e03dc2d5e [2024-11-22 10:43:37,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:43:37,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:43:37,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:43:37,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:43:37,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:43:37,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-11-22 10:43:39,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:43:39,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:43:39,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-11-22 10:43:39,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780837af0/20bfaa90e64241b28e06cd9d615683a1/FLAG681a92d36 [2024-11-22 10:43:39,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780837af0/20bfaa90e64241b28e06cd9d615683a1 [2024-11-22 10:43:39,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:43:39,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:43:39,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:43:39,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:43:39,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:43:39,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9c6ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39, skipping insertion in model container [2024-11-22 10:43:39,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:43:39,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-11-22 10:43:39,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:43:39,585 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:43:39,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-68.i[915,928] [2024-11-22 10:43:39,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:43:39,638 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:43:39,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39 WrapperNode [2024-11-22 10:43:39,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:43:39,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:43:39,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:43:39,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:43:39,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,678 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-22 10:43:39,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:43:39,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:43:39,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:43:39,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:43:39,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:43:39,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:43:39,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:43:39,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:43:39,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:43:39,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (1/1) ... [2024-11-22 10:43:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:43:39,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:43:39,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:43:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:43:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:43:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:43:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:43:39,798 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:43:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:43:39,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:43:39,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:43:39,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:43:41,009 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-22 10:43:41,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:43:41,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:43:41,027 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:43:41,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:43:41 BoogieIcfgContainer [2024-11-22 10:43:41,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:43:41,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:43:41,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:43:41,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:43:41,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:43:39" (1/3) ... [2024-11-22 10:43:41,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3004b47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:43:41, skipping insertion in model container [2024-11-22 10:43:41,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:43:39" (2/3) ... [2024-11-22 10:43:41,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3004b47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:43:41, skipping insertion in model container [2024-11-22 10:43:41,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:43:41" (3/3) ... [2024-11-22 10:43:41,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-68.i [2024-11-22 10:43:41,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:43:41,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:43:41,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:43:41,105 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;@2470668, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:43:41,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:43:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:43:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 10:43:41,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:41,137 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:41,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:41,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1400635848, now seen corresponding path program 1 times [2024-11-22 10:43:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:43:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325040454] [2024-11-22 10:43:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:43:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:43:41,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:43:41,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 10:43:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:41,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:43:41,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:43:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 10:43:41,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:43:41,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:43:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325040454] [2024-11-22 10:43:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325040454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:43:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:43:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:43:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886810588] [2024-11-22 10:43:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:43:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:43:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:43:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:43:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:43:41,453 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:43:41,478 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2024-11-22 10:43:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:43:41,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-22 10:43:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:43:41,487 INFO L225 Difference]: With dead ends: 95 [2024-11-22 10:43:41,487 INFO L226 Difference]: Without dead ends: 45 [2024-11-22 10:43:41,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:43:41,495 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:43:41,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:43:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-22 10:43:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-22 10:43:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:43:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-22 10:43:41,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 91 [2024-11-22 10:43:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:43:41,537 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-22 10:43:41,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:43:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-22 10:43:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 10:43:41,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:43:41,542 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:43:41,554 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 (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:43:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:43:41,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:43:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:43:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1176209040, now seen corresponding path program 1 times [2024-11-22 10:43:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:43:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627608015] [2024-11-22 10:43:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:43:41,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:43:41,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:43:41,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:43:41,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 10:43:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:43:41,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 10:43:41,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:43:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:43:53,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:43:53,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:43:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627608015] [2024-11-22 10:43:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627608015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:43:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:43:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:43:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345625685] [2024-11-22 10:43:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:43:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:43:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:43:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:43:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:43:53,222 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:44:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:44:11,645 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2024-11-22 10:44:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:44:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-22 10:44:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:44:11,661 INFO L225 Difference]: With dead ends: 118 [2024-11-22 10:44:11,661 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 10:44:11,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:44:11,662 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:44:11,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 278 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2024-11-22 10:44:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 10:44:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2024-11-22 10:44:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 10:44:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-22 10:44:11,684 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 91 [2024-11-22 10:44:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:44:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-22 10:44:11,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:44:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-22 10:44:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 10:44:11,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:44:11,689 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:44:11,700 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-11-22 10:44:11,890 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-11-22 10:44:11,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:44:11,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:44:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1956665124, now seen corresponding path program 1 times [2024-11-22 10:44:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:44:11,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350048282] [2024-11-22 10:44:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:44:11,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:44:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:44:11,897 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-11-22 10:44:11,899 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-11-22 10:44:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:44:12,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 10:44:12,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:44:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:44:35,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:44:35,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:44:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350048282] [2024-11-22 10:44:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350048282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:44:35,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:44:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:44:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718265905] [2024-11-22 10:44:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:44:35,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 10:44:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:44:35,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 10:44:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:44:35,560 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:45:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:45:10,400 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2024-11-22 10:45:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 10:45:10,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-22 10:45:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:45:10,419 INFO L225 Difference]: With dead ends: 122 [2024-11-22 10:45:10,419 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 10:45:10,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-11-22 10:45:10,421 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 121 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2024-11-22 10:45:10,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 263 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 27.8s Time] [2024-11-22 10:45:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 10:45:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2024-11-22 10:45:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 10:45:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-22 10:45:10,435 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 92 [2024-11-22 10:45:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:45:10,435 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-22 10:45:10,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:45:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-22 10:45:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 10:45:10,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:45:10,436 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:45:10,454 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-11-22 10:45:10,640 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-11-22 10:45:10,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:45:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:45:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1360843711, now seen corresponding path program 1 times [2024-11-22 10:45:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:45:10,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144365318] [2024-11-22 10:45:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:45:10,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:45:10,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:45:10,646 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:45:10,647 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 (5)] Waiting until timeout for monitored process [2024-11-22 10:45:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:45:10,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 10:45:10,818 INFO L278 TraceCheckSpWp]: Computing forward predicates...