./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_operatoramount_amount10_file-76.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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:38:34,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:38:34,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:38:34,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:38:34,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:38:34,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:38:34,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:38:34,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:38:34,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:38:34,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:38:34,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:38:34,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:38:34,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:38:34,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:38:34,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:38:34,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:38:34,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:38:34,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:38:34,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:38:34,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:38:34,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:38:34,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:38:34,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:38:34,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:38:34,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:38:34,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:38:34,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:38:34,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:38:34,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:38:34,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:38:34,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:38:34,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:38:34,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:38:34,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:38:34,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:38:34,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:38:34,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:38:34,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:38:34,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:38:34,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:38:34,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:38:34,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:38:34,857 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2024-11-18 23:38:35,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:38:35,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:38:35,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:38:35,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:38:35,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:38:35,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-18 23:38:36,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:38:36,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:38:36,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-18 23:38:36,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b7687a62/3dab2974179344da95d4e0a7cf6eaf3d/FLAG1817619cb [2024-11-18 23:38:36,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b7687a62/3dab2974179344da95d4e0a7cf6eaf3d [2024-11-18 23:38:36,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:38:36,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:38:36,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:38:36,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:38:36,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:38:36,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2589208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36, skipping insertion in model container [2024-11-18 23:38:36,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:38:36,644 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_operatoramount_amount10_file-76.i[915,928] [2024-11-18 23:38:36,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:38:36,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:38:36,687 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_operatoramount_amount10_file-76.i[915,928] [2024-11-18 23:38:36,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:38:36,711 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:38:36,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36 WrapperNode [2024-11-18 23:38:36,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:38:36,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:38:36,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:38:36,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:38:36,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,739 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-11-18 23:38:36,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:38:36,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:38:36,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:38:36,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:38:36,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,760 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-18 23:38:36,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:38:36,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:38:36,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:38:36,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:38:36,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (1/1) ... [2024-11-18 23:38:36,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:38:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:38:36,798 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-18 23:38:36,799 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-18 23:38:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:38:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:38:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:38:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:38:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:38:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:38:36,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:38:36,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:38:37,043 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 23:38:37,043 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:38:37,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:38:37,057 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:38:37,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:37 BoogieIcfgContainer [2024-11-18 23:38:37,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:38:37,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:38:37,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:38:37,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:38:37,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:38:36" (1/3) ... [2024-11-18 23:38:37,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc6e097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:38:37, skipping insertion in model container [2024-11-18 23:38:37,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:36" (2/3) ... [2024-11-18 23:38:37,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc6e097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:38:37, skipping insertion in model container [2024-11-18 23:38:37,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:37" (3/3) ... [2024-11-18 23:38:37,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2024-11-18 23:38:37,078 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:38:37,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:38:37,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:38:37,129 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;@39f96e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:38:37,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:38:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:38:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:38:37,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:37,144 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:38:37,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -621472132, now seen corresponding path program 1 times [2024-11-18 23:38:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:38:37,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957523093] [2024-11-18 23:38:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:38:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-18 23:38:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:38:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957523093] [2024-11-18 23:38:37,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957523093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:38:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248064600] [2024-11-18 23:38:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:38:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:38:37,356 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-18 23:38:37,358 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-18 23:38:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:37,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:38:37,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:38:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-18 23:38:37,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:38:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248064600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:38:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:38:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:38:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106931517] [2024-11-18 23:38:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:38:37,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:38:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:38:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:38:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:38:37,523 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 23:38:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:38:37,542 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2024-11-18 23:38:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:38:37,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-18 23:38:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:38:37,549 INFO L225 Difference]: With dead ends: 61 [2024-11-18 23:38:37,549 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 23:38:37,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-18 23:38:37,555 INFO L432 NwaCegarLoop]: 38 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, 38 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-18 23:38:37,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:38:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 23:38:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 23:38:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:38:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 23:38:37,586 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 52 [2024-11-18 23:38:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:38:37,586 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 23:38:37,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 23:38:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 23:38:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:38:37,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:37,589 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:38:37,603 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-18 23:38:37,789 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-18 23:38:37,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:37,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 176339458, now seen corresponding path program 1 times [2024-11-18 23:38:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:38:37,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901282062] [2024-11-18 23:38:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:38:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 23:38:38,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:38:38,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901282062] [2024-11-18 23:38:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901282062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:38:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:38:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:38:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171052630] [2024-11-18 23:38:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:38:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:38:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:38:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:38:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:38:38,053 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 23:38:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:38:38,101 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-18 23:38:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:38:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-18 23:38:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:38:38,105 INFO L225 Difference]: With dead ends: 57 [2024-11-18 23:38:38,105 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 23:38:38,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 23:38:38,107 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:38:38,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:38:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 23:38:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 23:38:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:38:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-18 23:38:38,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-18 23:38:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:38:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-18 23:38:38,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 23:38:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-18 23:38:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:38:38,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:38,114 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:38:38,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:38:38,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:38,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash 233597760, now seen corresponding path program 1 times [2024-11-18 23:38:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:38:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108431416] [2024-11-18 23:38:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:38,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:38:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:38:38,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:38:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:38:38,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:38:38,198 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:38:38,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:38:38,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:38:38,204 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 23:38:38,239 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:38:38,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:38:38 BoogieIcfgContainer [2024-11-18 23:38:38,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:38:38,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:38:38,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:38:38,242 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:38:38,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:37" (3/4) ... [2024-11-18 23:38:38,244 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:38:38,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:38:38,245 INFO L158 Benchmark]: Toolchain (without parser) took 1750.15ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 85.7MB in the beginning and 88.5MB in the end (delta: -2.7MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-18 23:38:38,245 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:38:38,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.04ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 72.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 23:38:38,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.92ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:38:38,248 INFO L158 Benchmark]: Boogie Preprocessor took 29.05ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:38:38,248 INFO L158 Benchmark]: RCFGBuilder took 287.79ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 68.2MB in the beginning and 166.0MB in the end (delta: -97.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-18 23:38:38,248 INFO L158 Benchmark]: TraceAbstraction took 1182.22ms. Allocated memory is still 197.1MB. Free memory was 166.0MB in the beginning and 89.5MB in the end (delta: 76.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-18 23:38:38,248 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 197.1MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:38:38,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.04ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 72.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.92ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.05ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.79ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 68.2MB in the beginning and 166.0MB in the end (delta: -97.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1182.22ms. Allocated memory is still 197.1MB. Free memory was 166.0MB in the beginning and 89.5MB in the end (delta: 76.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 197.1MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.81; [L23] float var_1_3 = 256.25; [L24] float var_1_4 = 1.75; [L25] double var_1_5 = 10000000.5; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] signed char var_1_10 = 5; [L30] double last_1_var_1_1 = 32.81; [L31] unsigned char last_1_var_1_6 = 0; VAL [isInitial=0, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_3=1025/4, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L58] last_1_var_1_1 = var_1_1 [L59] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_3=1025/4, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_3 = __VERIFIER_nondet_float() [L45] 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_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L45] 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_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L46] var_1_4 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L47] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L48] var_1_5 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L50] var_1_8 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L70] RET updateVariables() [L71] CALL step() [L35] COND FALSE !(last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(\read(last_1_var_1_6)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L41] var_1_10 = -50 VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) ? (var_1_1 == ((double) var_1_5)) : 1) && (last_1_var_1_6 ? (var_1_6 == ((unsigned char) (! (var_1_8 || var_1_9)))) : 1)) && (var_1_10 == ((signed char) -50)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 72 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 240/252 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-18 23:38:38,273 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/11.0.12-open/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_operatoramount_amount10_file-76.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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:38:40,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:38:40,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:38:40,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:38:40,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:38:40,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:38:40,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:38:40,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:38:40,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:38:40,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:38:40,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:38:40,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:38:40,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:38:40,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:38:40,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:38:40,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:38:40,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:38:40,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:38:40,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:38:40,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:38:40,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:38:40,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:38:40,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:38:40,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:38:40,125 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:38:40,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:38:40,126 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:38:40,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:38:40,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:38:40,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:38:40,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:38:40,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:38:40,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:38:40,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:38:40,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:38:40,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:38:40,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:38:40,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:38:40,128 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:38:40,129 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:38:40,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:38:40,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:38:40,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:38:40,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:38:40,130 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2024-11-18 23:38:40,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:38:40,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:38:40,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:38:40,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:38:40,401 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:38:40,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-18 23:38:41,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:38:41,810 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:38:41,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-11-18 23:38:41,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa8d0080/f2a792b81b0d422199a4283b9d1586b2/FLAG8cbe1be12 [2024-11-18 23:38:41,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa8d0080/f2a792b81b0d422199a4283b9d1586b2 [2024-11-18 23:38:41,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:38:41,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:38:41,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:38:41,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:38:41,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:38:41,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:38:41" (1/1) ... [2024-11-18 23:38:41,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322452f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:41, skipping insertion in model container [2024-11-18 23:38:41,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:38:41" (1/1) ... [2024-11-18 23:38:41,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:38:41,991 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_operatoramount_amount10_file-76.i[915,928] [2024-11-18 23:38:42,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:38:42,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:38:42,059 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_operatoramount_amount10_file-76.i[915,928] [2024-11-18 23:38:42,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:38:42,089 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:38:42,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42 WrapperNode [2024-11-18 23:38:42,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:38:42,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:38:42,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:38:42,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:38:42,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,119 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-11-18 23:38:42,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:38:42,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:38:42,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:38:42,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:38:42,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,153 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-18 23:38:42,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:38:42,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:38:42,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:38:42,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:38:42,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (1/1) ... [2024-11-18 23:38:42,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:38:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:38:42,206 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-18 23:38:42,209 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-18 23:38:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:38:42,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:38:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:38:42,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:38:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:38:42,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:38:42,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:38:42,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:38:43,012 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 23:38:43,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:38:43,022 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:38:43,022 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:38:43,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:43 BoogieIcfgContainer [2024-11-18 23:38:43,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:38:43,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:38:43,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:38:43,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:38:43,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:38:41" (1/3) ... [2024-11-18 23:38:43,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e867df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:38:43, skipping insertion in model container [2024-11-18 23:38:43,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:42" (2/3) ... [2024-11-18 23:38:43,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e867df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:38:43, skipping insertion in model container [2024-11-18 23:38:43,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:43" (3/3) ... [2024-11-18 23:38:43,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2024-11-18 23:38:43,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:38:43,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:38:43,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:38:43,100 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;@42848ad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:38:43,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:38:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:38:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:38:43,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:43,110 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:38:43,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash -621472132, now seen corresponding path program 1 times [2024-11-18 23:38:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:38:43,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425432347] [2024-11-18 23:38:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:43,137 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-18 23:38:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:38:43,139 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-18 23:38:43,142 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-18 23:38:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:43,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:38:43,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:38:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 23:38:43,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:38:43,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:38:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425432347] [2024-11-18 23:38:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425432347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:38:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:38:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:38:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888559832] [2024-11-18 23:38:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:38:43,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:38:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:38:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:38:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:38:43,337 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 23:38:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:38:43,352 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2024-11-18 23:38:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:38:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-11-18 23:38:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:38:43,358 INFO L225 Difference]: With dead ends: 61 [2024-11-18 23:38:43,358 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 23:38:43,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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-18 23:38:43,363 INFO L432 NwaCegarLoop]: 38 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, 38 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-18 23:38:43,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:38:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 23:38:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 23:38:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:38:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 23:38:43,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 52 [2024-11-18 23:38:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:38:43,390 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 23:38:43,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 23:38:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 23:38:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:38:43,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:43,392 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:38:43,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 23:38:43,593 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-18 23:38:43,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash 176339458, now seen corresponding path program 1 times [2024-11-18 23:38:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:38:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855271079] [2024-11-18 23:38:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:43,595 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-18 23:38:43,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:38:43,597 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-18 23:38:43,599 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-18 23:38:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:43,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 23:38:43,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:38:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 23:38:43,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:38:43,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:38:43,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855271079] [2024-11-18 23:38:43,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855271079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:38:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:38:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:38:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461732803] [2024-11-18 23:38:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:38:43,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:38:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:38:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:38:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:38:43,877 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 23:38:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:38:44,190 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-18 23:38:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:38:44,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-18 23:38:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:38:44,197 INFO L225 Difference]: With dead ends: 57 [2024-11-18 23:38:44,198 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 23:38:44,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-18 23:38:44,199 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:38:44,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:38:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 23:38:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 23:38:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:38:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-18 23:38:44,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2024-11-18 23:38:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:38:44,207 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-18 23:38:44,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 23:38:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-18 23:38:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:38:44,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:44,208 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:38:44,212 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 (3)] Ended with exit code 0 [2024-11-18 23:38:44,412 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-18 23:38:44,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:44,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 233597760, now seen corresponding path program 1 times [2024-11-18 23:38:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:38:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225444228] [2024-11-18 23:38:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:44,414 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-18 23:38:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:38:44,416 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-18 23:38:44,416 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-18 23:38:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:44,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 23:38:44,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:38:55,350 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-18 23:39:11,895 WARN L286 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-18 23:39:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 23:39:24,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:39:24,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:39:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225444228] [2024-11-18 23:39:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225444228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:39:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:39:24,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 23:39:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805503584] [2024-11-18 23:39:24,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:39:24,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:39:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:39:24,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:39:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:39:24,760 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 23:39:47,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:39:52,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:39:59,807 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-18 23:40:01,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:40:02,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:40:11,173 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-18 23:40:13,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 23:40:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:40:15,023 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-18 23:40:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 23:40:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2024-11-18 23:40:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:40:15,038 INFO L225 Difference]: With dead ends: 40 [2024-11-18 23:40:15,038 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 23:40:15,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-18 23:40:15,039 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:40:15,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 34.3s Time] [2024-11-18 23:40:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 23:40:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-18 23:40:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 23:40:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-18 23:40:15,045 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 52 [2024-11-18 23:40:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:40:15,045 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-18 23:40:15,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 23:40:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-18 23:40:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 23:40:15,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:40:15,046 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-18 23:40:15,051 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 (4)] Forceful destruction successful, exit code 0 [2024-11-18 23:40:15,247 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-18 23:40:15,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:40:15,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:40:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1541409602, now seen corresponding path program 1 times [2024-11-18 23:40:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:40:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556101391] [2024-11-18 23:40:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:40:15,248 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-18 23:40:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:40:15,251 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-18 23:40:15,251 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-18 23:40:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:40:15,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 23:40:15,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:40:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-18 23:40:18,678 INFO L311 TraceCheckSpWp]: Computing backward predicates...